Benchmarks for basic scheduling problems
References (14)
Some efficient heuristic methods for the flowshop sequencing problem
European Journal of Operational Research
(1990)- et al.
A new heuristic for the flowshop sequencing problem
European Journal of Operational Research
(1989) - et al.
A computational study of the job-shop scheduling problem
ORSA Journal on Computing
(1991) OR-Library: Distributing test problems by electronic mail
Journal of the Operational Research Society
(1990)- et al.
Constructive heuristic algorithms for the open shop problem
- et al.
A guide to Simulation
(1983) Problèmes d'ordonnancement à contraintes de ressources: Algorithmes et complexité
There are more references available in the full text version of this article.
Cited by (2012)
A hybrid evolution strategies-simulated annealing algorithm for job shop scheduling problems
2024, Engineering Applications of Artificial IntelligenceA deep reinforcement learning model for dynamic job-shop scheduling problem with uncertain processing time
2024, Engineering Applications of Artificial IntelligenceA branch-and-bound approach to the no-idle flowshop scheduling problem
2024, Discrete Applied MathematicsAn efficient collaborative multi-swap iterated greedy algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance
2024, Swarm and Evolutionary ComputationLong-sighted dispatching rules for manufacturing scheduling problem in Industry 4.0 hybrid approach
2024, Computers and Industrial EngineeringA multi-disjunctive-graph model-based memetic algorithm for the distributed job shop scheduling problem
2024, Advanced Engineering Informatics
Copyright © 1993 Published by Elsevier B.V.