Benchmarks for basic scheduling problems

  • Taillard E
  • 211


    Mendeley users who have this article in their library.
  • 1.3k


    Citations of this article.


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. © 1993.

Author-supplied keywords

  • Benchmarks
  • Combinatorial optimization
  • Scheduling

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • E. Taillard

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free