Job Shop Scheduling
Research Home Job Shop Home Taillard's Instances Demirkol's Instances SWV01-SWV15, ABZ07-ABZ09, YN01-YN04 Software
Home Research

Best known lower and upper bounds: Job Shop Scheduling Problem : Extra instances

       
    Name        Size        LB        UB   
Abz0720x15656(CPO2015)656(CPO2015)(sol)
Abz0820x15652(RL2024)667(GTA2013)(sol)
Abz0920x15678(CPO2015)678(GTA2013)(sol)
Swv0120x101407()1407(TSPR)(sol)
Swv0220x101475()1475(GTA2013)(sol)
Swv0320x101398(CPO2015)1398(GTA2013)(sol)
Swv0420x101464(CPO2015)1464(CPO2015)(sol)
Swv0520x101424(CPO2015)1424(CPO2015)(sol)
Swv0620x151635(RL2024)1667(PMAEDC2019)(sol)
Swv0720x151523(RL2024)1595(GTA2013)(sol)
Swv0820x151679(RL2024)1751(EVALDIVERSIFY)(sol)
Swv0920x151638(RL2024)1655(GTA2013)(sol)
Swv1020x151666(RL2024)1743(GTA2013)(sol)
Swv1150x102983()2983(GTA2013)(sol)
Swv1250x102972()2972(PMAEDC2019)(sol)
Swv1350x103104()3104(GTA2013)(sol)
Swv1450x102968()2968(GTA2013)(sol)
Swv1550x102885()2885(TSPR)(sol)
Yn0120x20854(CPO2015)884(GTA2013)(sol)
Yn0220x20879(RL2024)904(GTA2013)(sol)
Yn0320x20866(RL2024)892(GTA2013)(sol)
Yn0420x20935(RL2024)968(GTA2013)(sol)


This page provides upper and lower bounds for the following instances:

Abz07-Abz09 due to Adams, J. Balas, E., Zawack, D., 1988. "The shifting bottleneck procedure for job shop scheduling", Management Science, 34, pp. 391-401.

Swv01-Swv15 due to Robert H. Storer, S. David Wu, and Renzo Vaccari (1992) "New search spaces for sequencing problems with application to job shop scheduling", Management Science, 38, 10, 1495-1509.

Yn01-Yn04 due to Takeshi Yamada, Ryohei Nakano (1992), "A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems", In proceeding of: Parallel Problem Solving from Nature 2, 281-290

To submit a new upper bound, click here

Download these instances

The ith row of each solution file represents the processing order of jobs on the ith machine
(indexing of jobs starts from zero)

Last update: March 15, 2024