A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop (Q1762116): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2011.07.004 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine flowshop scheduling problem with total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing tardiness in a two-machine flow-shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dynamic scheduling in manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Scheduling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of priority rule-based scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of dispatching rules in dynamic flowshops and jobshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rule for minimizing the number of tardy jobs in dynamic flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000423 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2011.07.004 / rank
 
Normal rank

Latest revision as of 09:12, 11 December 2024

scientific article
Language Label Description Also known as
English
A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
scientific article

    Statements

    A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop (English)
    0 references
    0 references
    15 November 2012
    0 references
    scheduling
    0 references
    flowshop
    0 references
    heuristics
    0 references
    dispatching rules
    0 references
    mean tardiness
    0 references

    Identifiers