An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines (Q1870003): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on parallel machines subject to release dates and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:42, 5 June 2024

scientific article
Language Label Description Also known as
English
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
scientific article

    Statements

    An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines (English)
    0 references
    0 references
    0 references
    4 May 2003
    0 references
    identical parallel machines
    0 references
    release dates
    0 references
    due dates
    0 references
    maximum lateness
    0 references
    lower bound
    0 references
    preemption
    0 references

    Identifiers