Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics
- 1 September 2020
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 153
Abstract
No abstract availableKeywords
Funding Information
- Junta de Andalucía
- Ministerio de Ciencia e Innovación
This publication has 45 references indexed in Scilit:
- Scheduling with multiple serversAutomation and Remote Control, 2010
- A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problemEngineering Optimization, 2010
- Parallel dedicated machine scheduling problem with sequence-dependent setups and a single serverComputers & Industrial Engineering, 2010
- New high performing heuristics for minimizing makespan in permutation flowshopsOmega, 2009
- Scheduling jobs on a k-stage flexible flow-shopAnnals of Operations Research, 2007
- Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffersJournal of the Operational Research Society, 2006
- Parallel machine scheduling with a common serverDiscrete Applied Mathematics, 2000
- An evaluation of sequencing heuristics in flow shops with multiple processorsComputers & Industrial Engineering, 1996
- Two-Stage, Hybrid Flowshop Scheduling ProblemJournal of the Operational Research Society, 1988
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954