Single machine scheduling with family setups to minimize total earliness and tardiness (Q2467252): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batch setup times and earliness-tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with early and tardy completion costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of lower bounds for the single-machine early/tardy problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-tardiness scheduling with setup considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine problem with earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4032003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a class of single-machine weighted tardiness and earliness problems / rank
 
Normal rank

Latest revision as of 15:34, 27 June 2024

scientific article
Language Label Description Also known as
English
Single machine scheduling with family setups to minimize total earliness and tardiness
scientific article

    Statements

    Single machine scheduling with family setups to minimize total earliness and tardiness (English)
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    0 references
    single machine scheduling
    0 references
    earliness and tardiness
    0 references
    family setups
    0 references
    inserted idle time
    0 references
    branch and bound
    0 references
    heuristic algorithms
    0 references
    empirical results
    0 references
    0 references