An electromagnetism-like metaheuristic for open-shop problems with no buffer
Open Access
- 27 December 2012
- journal article
- Published by Springer Nature in Journal of Industrial Engineering International
- Vol. 8 (1)
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separatedRobotics and Computer-Integrated Manufacturing, 2009
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shopMathematical and Computer Modelling, 2008
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow timeEuropean Journal of Operational Research, 2008
- Heuristics for scheduling in a no-wait open shop with movable dedicated machinesInternational Journal of Production Economics, 2008
- Scheduling two-machine no-wait open shops to minimize makespanComputers & Operations Research, 2005
- An Electromagnetism-like Mechanism for Global OptimizationJournal of Global Optimization, 2003
- Classical and new heuristics for the open-shop problem: A computational evaluationEuropean Journal of Operational Research, 1998
- A branch & bound algorithm for the open-shop problemDiscrete Applied Mathematics, 1997
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in ProcessOperations Research, 1996
- Complexity of Scheduling Shops with No Wait in ProcessMathematics of Operations Research, 1979