Parallel machine scheduling with precedence constraints and setup times
- 7 March 2010
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 37 (12) , 2141-2151
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Climbing depth-bounded discrepancy search for solving hybrid flow shop problemsEuropean J. of Industrial Engineering, 2007
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up timesComputers & Operations Research, 2006
- Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational AnalysisAnnals of Operations Research, 2005
- List scheduling in a parallel machine environment with precedence constraints and setup timesOperations Research Letters, 2001
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- Parallel machine scheduling with release dates, due dates and family setup timesInternational Journal of Production Economics, 1996
- List scheduling revisitedOperations Research Letters, 1996
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup timesInternational Journal of Production Research, 1995
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problemEuropean Journal of Operational Research, 1995
- A state-of-the-art review of parallel-machine scheduling researchEuropean Journal of Operational Research, 1990