A memetic algorithm for the job-shop with time-lags
Authors:
- Anthony CaumondACAnthony Caumond
- Philippe LacommePLPhilippe Lacomme
- Nikolay TchernevNTNikolay Tchernev
- 1 July 2008
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 35 (7) , 2331-2356
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Permutation flowshop scheduling problems with maximal and minimal time lagsComputers & Operations Research, 2006
- Approximative procedures for no-wait job shop schedulingOperations Research Letters, 2003
- Job-shop scheduling with blocking and no-wait constraintsEuropean Journal of Operational Research, 2002
- Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum latenessInternational Journal of Production Economics, 2000
- Two-machine open shop scheduling with special transportation timesJournal of the Operational Research Society, 1999
- Time lag size in multiple operations flow shop scheduling heuristicsEuropean Journal of Operational Research, 1998
- A generalized permutation approach to job shop scheduling with genetic algorithmsOR Spectrum, 1995
- A two-machine flowshop sequencing problem with limited waiting time constraintsComputers & Industrial Engineering, 1995
- A genetic algorithm for flowshop sequencingComputers & Operations Research, 1995
- A survey of priority rule-based schedulingOR Spectrum, 1989