Scheduling a flowline manufacturing cell with sequence dependent family setup times
- 1 September 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 125 (2) , 324-339
- https://doi.org/10.1016/s0377-2217(99)00387-2
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemPublished by Elsevier ,2003
- A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMESProduction and Operations Management, 2000
- A review of scheduling research involving setup considerationsOmega, 1999
- Scheduling a flow-line manufacturing cell: a tabu search approachInternational Journal of Production Research, 1993
- Scheduling groups of jobs in the two-machine flow shopMathematical and Computer Modelling, 1990
- A new heuristic method for the flow shop sequencing problemEuropean Journal of Operational Research, 1989
- The two-machine sequence dependent flowshop scheduling problemEuropean Journal of Operational Research, 1986
- A survey and evaluation of static flowshop scheduling heuristicsInternational Journal of Production Research, 1984
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954