A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
From MaRDI portal
Publication:1410327
DOI10.1016/S0377-2217(02)00524-6zbMath1043.90034MaRDI QIDQ1410327
John L. Hunsucker, Henry W. Thornton
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Processing element allocation and dynamic scheduling codesign for multi-function SoCs ⋮ Two-stage proportionate flexible flow shop to minimize the makespan ⋮ A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. ⋮ A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness ⋮ An effective hybrid genetic algorithm for flow shop scheduling with limited buffers ⋮ An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production ⋮ The hybrid flow shop scheduling problem ⋮ The flexible blocking job shop with transfer and set-up times ⋮ A note of using effective immune based approach for the flow shop scheduling with buffers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some no-wait shops scheduling problems: Complexity aspect
- No-wait shop scheduling: Computational complexity and approximate algorithms
- Global lower bounds for flow shops with multiple processors
- Performance of scheduling algorithms for no-wait flowshops with parallel machines
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
- The permutation flow shop with buffers: A tabu search approach
- Heuristics for scheduling in a flow shop with multiple processors
- On the optimal assignment of servers in a two stations tandem queue with no intermediate waiting room
- Optimal two- and three-stage production schedules with setup times included
- Optimal Order for Servers in Series with No Queue Capacity
- Flowshop sequencing problems with limited buffer storage
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Optimal flowshop schedules with no intermediate storage space
- FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- On the Flow-Shop Sequencing Problem with No Wait in Process†
This page was built for publication: A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
