On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1577467
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Joel M. Wein / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091666830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with release dates on a single machine to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of a single machine to minimize total weighted completion time subject to release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on relaxations of a parallel machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n/1/?? dynamic deterministic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Techniques for Average Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A supermodular relaxation for scheduling with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing average completion time in the presence of release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with deadlines to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of a simple scheduling polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time indexed formulation of non-preemptive single machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to single-machine scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for the Identical Parallel Processor Weighted Flow Time Problem / rank
 
Normal rank

Latest revision as of 20:24, 24 June 2024

scientific article
Language Label Description Also known as
English
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
scientific article

    Statements

    On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    14 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial lower bounds
    0 references
    LP-based lower bounds
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references
    0 references