Related references
Note: Only part of the references are listed.SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
G. I. Zobolas et al.
CYBERNETICS AND SYSTEMS (2009)
Parallel machine scheduling problems with proportionally deteriorating jobs
Mingbao Cheng et al.
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE (2009)
A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
Zhigang Lian et al.
CHAOS SOLITONS & FRACTALS (2008)
A new particle swarm optimization for the open shop scheduling problem
D. Y. Sha et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
Modeling the planning and scheduling across the outsourcing supply chain: a Chaos-based fast Tabu-SA approach
Nishikant Mishra et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2008)
Performance evaluation of flexible manufacturing systems under uncertain and dynamic situations
V. Kumar et al.
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE (2008)
Non-greedy heuristics and augmented neural networks for the open-shop scheduling problem
S Colak et al.
NAVAL RESEARCH LOGISTICS (2005)
Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling
C Blum
COMPUTERS & OPERATIONS RESEARCH (2005)
Variable capacity sizing and selection of connections in a facility layout
SM Huang et al.
IIE TRANSACTIONS (2003)
Solving the open shop scheduling problem
U Dorndorf et al.
JOURNAL OF SCHEDULING (2001)
Share Paper
