New hard benchmark for flowshop scheduling problems minimising makespan (Q300036): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NILS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063345867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements à contraintes disjonctives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved NEH-based heuristic for the permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lessons of Flowshop Scheduling Research / 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: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling research after five decades / 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: Some Numerical Experiments for an <i>M</i> × <i>J</i> Flow Shop and its Decision-Theoretical Aspects / 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: An improved NEH heuristic to minimize makespan in permutation flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of the permutation flow shop problem based on a tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fifty years of scheduling: a survey of milestones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search Methodologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landscapes, Embedded Paths and Evolutionary Scheduling / 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 simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifting representation search for hybrid flexible flowline problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative metaheuristics for the permutation flowshop scheduling problem / 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: Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715715 / rank
 
Normal rank

Latest revision as of 05:58, 12 July 2024

scientific article
Language Label Description Also known as
English
New hard benchmark for flowshop scheduling problems minimising makespan
scientific article

    Statements

    New hard benchmark for flowshop scheduling problems minimising makespan (English)
    0 references
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    flowshop
    0 references
    makespan
    0 references
    benchmark
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers