Chams Lahlou

Institut Mines-Telecom

Ecole des mines de Nantes

 

File format

All values are integers, except the weights of jobs which are real numbers. The file must contain the following informations:


Number of jobs

Number of machines

Number of operations

Release date of job 1

Due date of job 1

Weight of job 1

Number of operations of job 1

Machine for operation 1 of job 1

Processing time of operation 1 of job 1

Machine for operation 2 of job 1

Processing time of operation 2 of job 1

...

Machine for last operation of job 1

Processing time of last operation of job 1

Release date of job 2

Due date of job 2

Weight of job 2

Number of operations of job 2

Machine for operation 1 of job 2

Processing time of operation 1 of job 2

machine for operation 2 of job 2

Processing time of operation 2 of job 2

...

Machine for last operation of job 2

Processing time of last operation of job 2

...


Example:


10 5 36

0   14  1.75927  4 2 4 3 14 4 5 5 5

19  29  1.81108  3 1 18 4 9 5 5

44  49  1.45308  3 1 9 4 7 5 7

47  65  1.79529  4 2 8 3 12 4 5 5 3

50  46  3.00966  4 2 7 3 21 4 7 5 8

74  76  1.57692  3 1 12 4 6 5 9

77  137 2.53825  4 2 11 3 22 4 2 5 9

99  133 1.93564  4 2 8 3 18 4 5 5 7

102 117 0.858029 3 1 1 4 9 5 4

114 154 2.13642  4 2 11 3 15 4 4 5 3


Here, the first line defines a problem with 10 jobs, 5 machines and 36 operations. Line 3, for example, defines the characteristics of job 2, i.e. the release date is 19, the due date is 29, the weight is 1.81108 and there are 3 operations: the first operation must be processed on machine 1 and has processing time 18, the second one must be processed on machine 4 and has processing time 9, and the last operation must be processed on machine 5 with a processing time equal to 5.


Taillard

This benchmark was proposed for the makespan criterion in E. Taillard. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993;64; 278-285.


Download the zip file of instances.

See up-to-date lower and upper bounds on Taillard’s page.



Singer and Pinedo

This benchmark was proposed for the total sum of weighed tardiness criterion. It is based on a selection of classical instances for the makespan criterion to which due dates and weights have been added. All details are in M. Singer and M. Pinedo. Computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Transactions 1998;29; 109-119.


Download the zip file of instances.

See our new best solutions.



Morton and Pentico

This benchmark was introduced with the software PARSIFAL (Morton T E, Pentico D W. Heuristic Scheduling Systems. John Wiley & Sons, NY; 1993). The instances are not designed for a specific criterion: jobs have release and due dates, weights, and may be re-entrant (i.e. can be executed several times by the same machine).

Notice that, for crtiterion wjCj, all papers actually report the value wj(Cj-rj) on these instances.


Download the zip file of instances.

See our new best solutions.



Extension of Taillard’s instances

We have applied to Taillard’s instances Singer and Pinedo’s ways to generate due dates and weights.


Download the zip file of instances.

See our solutions.

Optimizing regular criteria for the job shop scheduling problem

Joint work with Y. Mati1 and S. Dauzère-Pérès2


  1. 1.                                   . Al-Qassim University - College of Business and Economics,  Kingdom of Saudi Arabia.

  2. 2. Ecole des mines de Saint-Etienne - Centre Microélectronique de Provence, France.