A neighborhood for complex job shop scheduling problems with regular objectives
- 14 June 2017
- journal article
- research article
- Published by Springer Science and Business Media LLC in Journal of Scheduling
- Vol. 20 (4), 391-422
- https://doi.org/10.1007/s10951-017-0532-2
Abstract
No abstract availableKeywords
Funding Information
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (P2FRP2_161720)
This publication has 31 references indexed in Scilit:
- An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimizationSoft Computing, 2012
- A general approach for optimizing regular criteria in the job-shop scheduling problemEuropean Journal of Operational Research, 2011
- A new neighborhood and tabu search for the Blocking Job ShopDiscrete Applied Mathematics, 2009
- Fifty years of scheduling: a survey of milestonesJournal of the Operational Research Society, 2009
- A very fast TS/SA algorithm for the job shop scheduling problemComputers & Operations Research, 2008
- Feasible insertions in job shop scheduling, short cycles and stable setsEuropean Journal of Operational Research, 2007
- Job-shop scheduling with blocking and no-wait constraintsEuropean Journal of Operational Research, 2002
- The job shop scheduling problem: Conventional and new solution techniquesEuropean Journal of Operational Research, 1996
- A branch and bound algorithm for the job-shop scheduling problemDiscrete Applied Mathematics, 1994
- JOB SHOPS SCHEDULING WITH DUE DATESInternational Journal of Production Research, 1967