Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimizing maximum lateness on one machine: computational experience and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with release dates and tails on identical machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for naive multiple machine scheduling with release times and deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with earliest start and due date constraints on multiple machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of constraint satisfaction for multiple capacitated job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general lower bound for the makespan problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with limited machine availability / rank
 
Normal rank

Revision as of 11:27, 4 June 2024

scientific article
Language Label Description Also known as
English
Minimizing makespan on parallel machines subject to release dates and delivery times
scientific article

    Statements

    Minimizing makespan on parallel machines subject to release dates and delivery times (English)
    0 references
    0 references
    0 references
    8 August 2002
    0 references
    scheduling
    0 references
    identical parallel machines
    0 references
    makespan
    0 references
    release dates
    0 references
    delivery times
    0 references
    branch-and-bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references