A search algorithm for the generalized flowshop scheduling problem
- 30 September 1975
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 2 (2) , 83-90
- https://doi.org/10.1016/0305-0548(75)90011-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- M-stage scheduling problem—a critical appraisalInternational Journal of Production Research, 1971
- Review of sequencing researchNaval Research Logistics Quarterly, 1970
- ErrataOperations Research, 1969
- The machine sequencing problem – review and extensionsNaval Research Logistics Quarterly, 1968
- A GENERAL ALGORITHM FOR THEn × MFLOWSHOP SCHEDULING PROBLEM†International Journal of Production Research, 1968
- A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow ShopOperations Research, 1967
- Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling ProblemJournal of the Operational Research Society, 1966
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M MachinesOperations Research, 1964
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954