Makespan and workstation utilization minimization in a flowshop with operations flexibility
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion timesInternational Journal of Production Economics, 2008
- An improved NEH-based heuristic for the permutation flowshop problemComputers & Operations Research, 2007
- Flowshop scheduling research after five decadesEuropean Journal of Operational Research, 2006
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problemInternational Journal of Production Research, 2003
- Sequencing and scheduling in flowshops with task redistributionJournal of the Operational Research Society, 2001
- Flowshop scheduling with dominant machinesComputers & Operations Research, 1995
- A new heuristic for the n-job, M-machine flow-shop problemEuropean Journal of Operational Research, 1991
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954