Scheduling with a common due-window: polynomially solvable cases (Q2269806): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the state-of-the-art of common due date assignment and scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Assembly Line Crew Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due window scheduling for parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel machine min-max weighted absolute lateness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of common due window location in a single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common due window size and location determination in a single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-tardiness scheduling problems with a common delivery window / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due-date assignment with asymmetric earliness–tardiness cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due-window assignment with unit processing-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax earliness-tardiness costs with unit processing time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals / rank
 
Normal rank

Latest revision as of 13:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Scheduling with a common due-window: polynomially solvable cases
scientific article

    Statements

    Scheduling with a common due-window: polynomially solvable cases (English)
    0 references
    0 references
    0 references
    11 March 2010
    0 references
    0 references
    scheduling
    0 references
    linear programming
    0 references
    earliness-tardiness cost
    0 references
    common due-window
    0 references
    0 references