Performance guarantees for flowshop heuristics to minimize makespan
From MaRDI portal
Publication:2572856
DOI10.1016/j.ejor.2004.05.034zbMath1079.90052OpenAlexW2063327588MaRDI QIDQ2572856
Jatinder N. D. Gupta, Christos P. Koulamas, Kyparisis, George J.
Publication date: 4 November 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.05.034
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A linear time approximation algorithm for permutation flow shop scheduling
Cites Work
- New results in the worst-case analysis for flow-shop scheduling
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Permutation vs. non-permutation flow shop schedules
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- Approximability of flow shop scheduling
- Some results of the worst-case analysis for flow shop scheduling
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- On some geometric methods in scheduling theory: A survey
- Optimal two- and three-stage production schedules with setup times included
- On the Expected Relative Performance of List Scheduling
- Note on the algorithm for Johnson's single-route problem
- A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- Optimal schedules for special structure flowshops
- Flowshop and Jobshop Schedules: Complexity and Approximation
- An Evaluation of Flow Shop Sequencing Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- Improved Approximation Algorithms for Shop Scheduling Problems
- A New Heuristic for Three-Machine Flow Shop Scheduling
- Short Shop Schedules
- A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A Note on Heuristics of Flow-Shop Scheduling
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Performance guarantees for flowshop heuristics to minimize makespan
