A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness (Q869149): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57185847, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impact of sequence-dependent setup time on job shop scheduling performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job shop scheduling with group-dependent setups, finite buffers, and long time horizon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in a sequence dependent setup environment with genetic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction heuristics for the asymmetric TSP. / rank
 
Normal rank

Revision as of 14:19, 25 June 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
scientific article

    Statements

    A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness (English)
    0 references
    0 references
    0 references
    26 February 2007
    0 references
    combinatorial optimization
    0 references
    maximum tardiness
    0 references
    sequence-dependent setup
    0 references
    branch and bound
    0 references
    single machine schedule
    0 references

    Identifiers