Matches in SemOpenAlex for { <https://semopenalex.org/work/W1596968903> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W1596968903 abstract "The problem of scheduling jobs with interval constraints is a well-studied classical scheduling problem. The input to the problem is a collection of n jobs where each job has a set of intervals on which it can be scheduled. The goal is to minimize the total number of machines needed to schedule all jobs subject to these interval constraints. In the continuous version, the allowed intervals associated with a job form a continuous time segment, described by a release date and a deadline. In the discrete version of the problem, the set of allowed intervals for a job is given explicitly. So far, only an O(log n/( log log n))-approximation is known for either version of the problem, obtained by a randomized rounding of a natural linear programming relaxation of the problem. In fact, we show here that this analysis is tight for both versions of the problem by providing a matching lower bound on the integrality gap of the linear program. Moreover, even when all jobs can be scheduled on a single machine, the discrete case has recently been shown to be /spl Omega/(log log n)-hard to approximate. In this paper, we provide improved approximation factors for the number of machines needed to schedule all jobs in the continuous version of the problem. Our main result is an O(1)-approximation algorithm when the optimal number of machines needed is bounded by a fixed constant. Thus, our results separate the approximability of the continuous and the discrete cases of the problem. For general instances, we strengthen the natural linear programming relaxation in a recursive manner by forbidding certain configurations which cannot arise in an integral feasible solution. This yields an O(OPT)-approximation, where OPT denotes the number of machines needed by an optimal solution. Combined with earlier results, our work implies an O(/spl radic/log n/(log log n))-approximation for any value of OPT." @default.
- W1596968903 created "2016-06-24" @default.
- W1596968903 creator A5017534381 @default.
- W1596968903 creator A5025400832 @default.
- W1596968903 creator A5039619350 @default.
- W1596968903 creator A5056023203 @default.
- W1596968903 date "2004-12-23" @default.
- W1596968903 modified "2023-10-18" @default.
- W1596968903 title "Machine Minimization for Scheduling Jobs with Interval Constraints" @default.
- W1596968903 cites W1595494000 @default.
- W1596968903 cites W1990180428 @default.
- W1596968903 cites W2001364911 @default.
- W1596968903 cites W2003902046 @default.
- W1596968903 cites W2022191808 @default.
- W1596968903 cites W2025470209 @default.
- W1596968903 cites W2069832779 @default.
- W1596968903 cites W2074557115 @default.
- W1596968903 doi "https://doi.org/10.1109/focs.2004.38" @default.
- W1596968903 hasPublicationYear "2004" @default.
- W1596968903 type Work @default.
- W1596968903 sameAs 1596968903 @default.
- W1596968903 citedByCount "30" @default.
- W1596968903 countsByYear W15969689032013 @default.
- W1596968903 countsByYear W15969689032014 @default.
- W1596968903 countsByYear W15969689032015 @default.
- W1596968903 countsByYear W15969689032016 @default.
- W1596968903 countsByYear W15969689032017 @default.
- W1596968903 countsByYear W15969689032018 @default.
- W1596968903 countsByYear W15969689032019 @default.
- W1596968903 countsByYear W15969689032020 @default.
- W1596968903 countsByYear W15969689032023 @default.
- W1596968903 crossrefType "proceedings-article" @default.
- W1596968903 hasAuthorship W1596968903A5017534381 @default.
- W1596968903 hasAuthorship W1596968903A5025400832 @default.
- W1596968903 hasAuthorship W1596968903A5039619350 @default.
- W1596968903 hasAuthorship W1596968903A5056023203 @default.
- W1596968903 hasBestOaLocation W15969689032 @default.
- W1596968903 hasConcept C111919701 @default.
- W1596968903 hasConcept C114614502 @default.
- W1596968903 hasConcept C126255220 @default.
- W1596968903 hasConcept C147764199 @default.
- W1596968903 hasConcept C199360897 @default.
- W1596968903 hasConcept C206729178 @default.
- W1596968903 hasConcept C2778067643 @default.
- W1596968903 hasConcept C2984822820 @default.
- W1596968903 hasConcept C33923547 @default.
- W1596968903 hasConcept C41008148 @default.
- W1596968903 hasConcept C55416958 @default.
- W1596968903 hasConcept C68387754 @default.
- W1596968903 hasConceptScore W1596968903C111919701 @default.
- W1596968903 hasConceptScore W1596968903C114614502 @default.
- W1596968903 hasConceptScore W1596968903C126255220 @default.
- W1596968903 hasConceptScore W1596968903C147764199 @default.
- W1596968903 hasConceptScore W1596968903C199360897 @default.
- W1596968903 hasConceptScore W1596968903C206729178 @default.
- W1596968903 hasConceptScore W1596968903C2778067643 @default.
- W1596968903 hasConceptScore W1596968903C2984822820 @default.
- W1596968903 hasConceptScore W1596968903C33923547 @default.
- W1596968903 hasConceptScore W1596968903C41008148 @default.
- W1596968903 hasConceptScore W1596968903C55416958 @default.
- W1596968903 hasConceptScore W1596968903C68387754 @default.
- W1596968903 hasLocation W15969689031 @default.
- W1596968903 hasLocation W15969689032 @default.
- W1596968903 hasOpenAccess W1596968903 @default.
- W1596968903 hasPrimaryLocation W15969689031 @default.
- W1596968903 hasRelatedWork W1505391644 @default.
- W1596968903 hasRelatedWork W1552313225 @default.
- W1596968903 hasRelatedWork W1602329537 @default.
- W1596968903 hasRelatedWork W2083950719 @default.
- W1596968903 hasRelatedWork W2088389093 @default.
- W1596968903 hasRelatedWork W2105304368 @default.
- W1596968903 hasRelatedWork W2520902986 @default.
- W1596968903 hasRelatedWork W2546696010 @default.
- W1596968903 hasRelatedWork W2983457431 @default.
- W1596968903 hasRelatedWork W4297412199 @default.
- W1596968903 isParatext "false" @default.
- W1596968903 isRetracted "false" @default.
- W1596968903 magId "1596968903" @default.
- W1596968903 workType "article" @default.