An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3964287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions to the Constrained Flowshop Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation / 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: An effective new heuristic algorithm for solving permutation flow shop scheduling problem / 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: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem / 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: A new heuristic for the n-job, M-machine flow-shop problem / 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: A new constructive heuristic for the flowshop scheduling problem / 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 comprehensive review and evaluation of permutation flowshop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hard benchmark for flowshop scheduling problems minimising makespan / rank
 
Normal rank

Revision as of 01:51, 30 July 2024

scientific article; zbMATH DE number 7582947
Language Label Description Also known as
English
An effective new heuristic algorithm for solving permutation flow shop scheduling problem
scientific article; zbMATH DE number 7582947

    Statements

    9 September 2022
    0 references
    heuristic
    0 references
    flowshop
    0 references
    scheduling
    0 references
    makespan
    0 references
    total completion time
    0 references
    An effective new heuristic algorithm for solving permutation flow shop scheduling problem (English)
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references