Restricted-Access

 

 
       

 

JOB SHOP SCHEDULIND PROBLEM> BENCHMARKING INSTANCES

                                                                                                                                                                                                                                                               

 

Last update: 06/2011

 

We have selected the following eight benchmarking instances of OR-Library. Each instance file is a .txt file which includes the following information:

 

 

instance machines x jobs to find the optimum to find multiple optima
la01 5 x 10 easy easy
la02 5 x 10 easy easy
la03 5 x 10 easy difficult
la04 5 x 10 easy difficult
la05 5 x 10 easy easy
mt06 6 x 10 easy easy
mt10 10 x 10 difficult very difficult
mt20 5 x 20 difficult very difficult
 

However, there are 82 JSSP test instances commonly cited in the literature. The format of these test instances is described in the file: jobshop1.txt

 

■ abz5-abz9 J. Adams, E. Balas and D. Zawack (1988),   The shifting bottleneck procedure for job shop scheduling, Management Science 34, 391-401.
■ mt06, mt10, mt20

(also called ft06, ft10, ft20)

H. Fisher, G.L. Thompson (1963), Probabilistic learning combinations of local job-shop scheduling rules, J.F. Muth, G.L. Thompson (eds.), Industrial Scheduling,  Prentice Hall, Englewood Cliffs, New Jersey, 225-251.
■ la01-la40 S. Lawrence (1984), Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement), Graduate School of Industrial Administration,Carnegie-Mellon University, Pittsburgh, Pennsylvania.
■ orb01-orb10 D. Applegate, W. Cook (1991),A computational study of the job-shop scheduling instance, ORSA Journal on Computing 3, 149-156.
■ swv01-swv20 R.H. Storer, S.D. Wu, R. Vaccari (1992), New search spaces for sequencing instances with application to job shop  scheduling, Management Science 38, 1495-1509.
■ yn1-yn4 T. Yamada, R. Nakano (1992),A genetic algorithm applicable to large-scale job-shop instances, R. Manner, B. Manderick (eds.),Parallel instance solving from nature 2,North-Holland, Amsterdam,  281-290

Source: E.Taillard (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278-285.

 

Source and more information: OR-Library

 

   

Universidad de Valladolid. Webmaster Marta Posada