Benchmarks for basic scheduling problems

https://doi.org/10.1016/0377-2217(93)90182-MGet rights and content

Abstract

In this paper, we propose 260 randomly generated scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems that we propose are: the permutation flow shop, the job shop and the open shop scheduling problems. We restrict ourselves to basic problems: the processing times are fixed, there are neither set-up times nor due dates nor release dates, etc. Then, the objective is the minimization of the makespan.

References (14)

  • E. Taillard

    Some efficient heuristic methods for the flowshop sequencing problem

    European Journal of Operational Research

    (1990)
  • M. Widmer et al.

    A new heuristic for the flowshop sequencing problem

    European Journal of Operational Research

    (1989)
  • D. Applegate et al.

    A computational study of the job-shop scheduling problem

    ORSA Journal on Computing

    (1991)
  • J.E. Beasley

    OR-Library: Distributing test problems by electronic mail

    Journal of the Operational Research Society

    (1990)
  • H. Bräsel et al.

    Constructive heuristic algorithms for the open shop problem

  • P. Bratley et al.

    A guide to Simulation

    (1983)
  • J. Carlier

    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)

View all citing articles on Scopus
View full text