Scheduling heuristic for the n-jobm-machine flow shop
- 1 March 1993
- Vol. 21 (2) , 229-234
- https://doi.org/10.1016/0305-0483(93)90055-p
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A Review of Production SchedulingOperations Research, 1981
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- A Comparative Study of Flow-Shop AlgorithmsOperations Research, 1975
- Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling ProblemOperations Research, 1971
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- A Branch-and-Bound Algorithm for Flow Shop Scheduling ProblemsA I I E Transactions, 1970
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954