Experimental comparison of heuristics for flow shop scheduling (Q4812723): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02522667.2002.10699530 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2333683423 / 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: The Lessons of Flowshop Scheduling Research / 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: A Functional Heuristic Algorithm for the Flowshop Scheduling 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 Note on Heuristics of Flow-Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of an approximation algorithm for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results in the worst-case analysis for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on worst-case analysis of approximation algorithms for a scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results of the worst-case analysis for flow shop scheduling / 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: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification to the CGPS algorithm for three-machine flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank

Latest revision as of 20:30, 6 June 2024

scientific article; zbMATH DE number 2094337
Language Label Description Also known as
English
Experimental comparison of heuristics for flow shop scheduling
scientific article; zbMATH DE number 2094337

    Statements

    Experimental comparison of heuristics for flow shop scheduling (English)
    0 references
    23 August 2004
    0 references
    0 references
    0 references
    0 references