Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan
- 31 May 1992
- journal article
- Published by Elsevier in International Journal of Production Economics
- Vol. 27 (2), 137-143
- https://doi.org/10.1016/0925-5273(92)90006-s
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Scheduling algorithms for flexible flowshops: Worst and average case performanceEuropean Journal of Operational Research, 1989
- An Adaptable Scheduling Algorithm for Flexible Flow LinesOperations Research, 1988
- Two-Stage, Hybrid Flowshop Scheduling ProblemJournal of the Operational Research Society, 1988
- A New Bound for Machine SchedulingJournal of the Operational Research Society, 1976
- A Method of Solution for General Machine-Scheduling ProblemsOperations Research, 1970
- Flow-Shop Scheduling with the Branch-and-Bound MethodOperations Research, 1967
- Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling ProblemJournal of the Operational Research Society, 1966
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling ProblemJournal of the Operational Research Society, 1965