Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers
- 31 May 2009
- journal article
- Published by Elsevier BV in Computers & Industrial Engineering
- Vol. 56 (4), 1452-1463
- https://doi.org/10.1016/j.cie.2008.09.004
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraintsComputers & Industrial Engineering, 2004
- New heuristics for no-wait flowshops to minimize makespanComputers & Operations Research, 2003
- Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithmsJournal of the Operational Research Society, 2003
- SCHEDULING HYBRID FLOWSHOPS IN PRINTED CIRCUIT BOARD ASSEMBLY LINES*Production and Operations Management, 2002
- Minimizing tardy jobs in a two-stage hybrid flowshopInternational Journal of Production Research, 1998
- Aggregate planning in hybrid flowshopsInternational Journal of Production Research, 1998
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion timeInternational Journal of Production Research, 1996
- Modified simulated annealing algorithms for the flow shop sequencing problemEuropean Journal of Operational Research, 1995
- An application of genetic algorithms for flow shop problemsEuropean Journal of Operational Research, 1995
- BPSS: A Scheduling Support System for the Packaging IndustryOperations Research, 1993