FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
From MaRDI portal
Publication:4718639
DOI10.1080/02522667.1995.10699233zbMath0861.90076OpenAlexW2089278409MaRDI QIDQ4718639
John L. Hunsucker, Daryl L. Santos, D. E. Deal
Publication date: 12 May 1997
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1995.10699233
Related Items
Scheduling flexible flow lines with sequence-dependent setup times, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage., The hybrid flow shop scheduling problem, Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
Cites Work
- Unnamed Item
- Branch and bound algorithm for the flow shop with multiple processors
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- The Two-Stage Flowshop Scheduling Problem with M Machines at each Stage
- An Evaluation of Flow Shop Sequencing Heuristics
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
