A clustering-based modified variable neighborhood search algorithm for a dynamic job shop scheduling problem
Authors:
- 5 November 2013
- journal article
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 70 (9-12) , 1955-1961
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Dynamic job shop scheduling using variable neighbourhood searchInternational Journal of Production Research, 2009
- Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problemsInternational Journal of Production Research, 2009
- Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup timesInternational Journal of Production Research, 2008
- Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental studyRobotics and Computer-Integrated Manufacturing, 2008
- A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due dateComputers & Industrial Engineering, 2007
- Dynamic rescheduling that simultaneously considers efficiency and stabilityComputers & Industrial Engineering, 2004
- Reactive scheduling in a dynamic and stochastic FMS environmentInternational Journal of Production Research, 2003
- J-Means: a new local search heuristic for minimum sum of squares clusteringPattern Recognition, 2001
- Implementation of an auction-based distributed scheduling model for a dynamic job shop environmentInternational Journal of Computer Integrated Manufacturing, 2001
- Heuristics for dynamic job shop scheduling with real-time updated queueing time estimatesInternational Journal of Production Research, 1997