Flowshop scheduling with set-up, processing and removal times separated
- 1 March 1991
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 29 (3) , 479-493
- https://doi.org/10.1080/00207549108930084
Abstract
Algorithms are developed for finding an optimal or near-optimal permutation schedule for the static flowshop scheduling problem where set-up, processing, and removal times are separable. Computational experience with the proposed heuristic algorithms indicates that they are quite effective in minimizing the makespan for a given problem.Keywords
This publication has 16 references indexed in Scilit:
- A MILP model for then-job,M-stage flowshop with sequence dependent set-up timesInternational Journal of Production Research, 1986
- 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
- Sequency on two and three machines with setup, processing and removal times separatedInternational Journal of Production Research, 1983
- Sequencing n jobs on two machines with setup, processing and removal times separatedNaval Research Logistics Quarterly, 1982
- Optimal Two-Stage Production Scheduling with Setup Times SeparatedA I I E Transactions, 1979
- A search algorithm for the generalized flowshop scheduling problemComputers & Operations Research, 1975
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approachNaval Research Logistics Quarterly, 1974
- A GENERAL ALGORITHM FOR THEn × MFLOWSHOP SCHEDULING PROBLEM†International Journal of Production Research, 1968
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954