Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2007.12.013 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop-scheduling problems with makespan criterion: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Sequencing <i>n</i> Jobs on <i>m</i> Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution / 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: Scheduling in flowshops to minimize total tardiness of jobs / 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: Q3378953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / 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: A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3970631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some effective heuristics for no-wait flowshops with setup times to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling problems with setup times or costs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2007.12.013 / rank
 
Normal rank

Latest revision as of 10:03, 10 December 2024

scientific article
Language Label Description Also known as
English
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
scientific article

    Statements

    Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (English)
    0 references
    0 references
    0 references
    4 December 2008
    0 references
    scheduling
    0 references
    flowshop
    0 references
    bicriteria
    0 references
    multiobjective
    0 references
    heuristics
    0 references
    metaheuristics
    0 references
    genetic algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers