JSPT-C results

This web page provides a full description of the instances and the results introduced in:

Amine Oussama, Jean-Philippe Gayon, Philippe Lacomme. Job-Shop Scheduling with Cooperative Transportation Resources. ROADEF 2025-26ème congrès de la société Française de Recherche Opérationnelle et d’Aide à la Décision, Paris, France, February 26-28 2025.
Jean-Philippe Gayon, Philippe Lacomme and Amine Oussama Job-Shop Scheduling with Cooperative Transportation Resources. International Transactions in Operational Research (Submitting paper).

Instance file format:

Refer to the picture below for an example of the instance file EX11C3.txt

MILP (CPLEX) solution file format:

Refer to the picture below for an example of the MILP solution for the instance EX11C3

GRASPxELS solution file format:

Refer to the picture below for an example of the result of the first run of GRASPxELS for the instance EX11C3

Detailed results:

1. Comparative study with (Ham, 2020) on (Bilge and Ulusoy, 1995) instances for the JSPT:

Instance: The name of the instance used for the evaluation.
S: Best makespan found by the method
GAP: Linear relaxation GAP reported by Solver (in %)
T: Total computational time (in seconds) taken by the method to solve the instance
T_scale: Scaled computational time (in seconds)
Download: A link to the solution file

Example Image — Download instances and results

Instance	CP2 (Ham, 2020)		Our Proposed MILP				Download
Instance	S	T	S	GAP	T	T_scale	Download
EX11	96	0.83	96	0	2.98	6.17	Solution
EX12	82	0.44	82	0	0.49	1.01	Solution
EX13	84	0.39	84	0	0.77	1.59	Solution
EX14	103	1.26	103	0	2.24	4.64	Solution
EX21	100	2.21	100	0	5.53	11.45	Solution
EX22	76	0.17	76	0	1.09	2.26	Solution
EX23	86	1.59	86	0	4.41	8.82	Solution
EX24	108	5.02	108	0	10.88	22.52	Solution
EX31	99	1.26	99	0	4.40	9.11	Solution
EX32	85	0.49	85	0	1.66	3.44	Solution
EX33	86	0.26	86	0	0.94	1.95	Solution
EX34	111	2.08	111	0	9.14	18.92	Solution
EX41	112	22.42	112	0	142.35	294.66	Solution
EX42	87	3.88	87	0	29.21	60.46	Solution
EX43	89	2.37	89	0	22.48	46.53	Solution
EX44	121	7.60	121	0	26.01	52.02	Solution
EX51	87	1.39	87	0	6.68	13.83	Solution
EX52	69	0.46	69	0	0.95	1.97	Solution
EX53	74	1.23	74	0	1.44	2.98	Solution
EX54	96	2.18	96	0	1.83	3.79	Solution
EX61	118	4.40	118	0	55.25	114.37	Solution
EX62	98	0.39	98	0	3.82	7.91	Solution
EX63	103	0.66	103	0	4.72	9.77	Solution
EX64	120	3.72	120	0	15.96	33.04	Solution
EX71	111	406.28	112	23.21	392.07	811.58	Solution
EX72	79	1.22	79	0	16.84	34.86	Solution
EX73	83	2.58	83	0	18.76	38.83	Solution
EX74	126	792.88	127	39.21	392.07	811.58	Solution
EX81	161	0.07	161	0	4.47	9.25	Solution
EX82	151	0.02	151	0	2.25	4.66	Solution
EX83	153	0.01	153	0	4.84	10.02	Solution
EX84	163	0.14	163	0	3.83	7.93	Solution
EX91	116	0.95	116	0	2.91	6.02	Solution
EX92	102	0.27	102	0	3.06	6.33	Solution
EX93	105	0.38	105	0	4.70	9.73	Solution
EX94	120	1.30	120	0	9.92	20.53	Solution
EX101	146	2.35	146	0	42.67	88.33	Solution
EX102	135	0.67	135	0	7.37	15.26	Solution
EX103	137	1.30	137	0	17.95	37.16	Solution
EX104	157	12.80	157	0	189.78	392.84	Solution
Avg.		32.24		1.56	36.71	76.00

2. Computational evaluation for the JSPT-C on instances adapted from (Bilge and Ulusoy, 1995):

Instance: The name of the instance used for the evaluation.
S: Best makespan found by the method
GAP*: GAP to optimal solution (in %)
T*: Time to converge to optimality (in seconds)
T_best: Time to best found solution in the given computational time limit (in seconds)
Download: A link to the solution file

Instance	MILP				GRASPxELS
Instance	S	GAP*	T*	Download	S	GAP*	T_best	Download (Run 1)	Download (Run 2)	Download (Run 3)	Download (Run 4)	Download (Run 5)
EX11C2	113	0	0.74	Solution	113	0	0.04	Solution	Solution	Solution	Solution	Solution
EX11C3	88	0	0.25	Solution	88	0	0.02	Solution	Solution	Solution	Solution	Solution
EX11C5	92	0	0.42	Solution	92	0	0.31	Solution	Solution	Solution	Solution	Solution
EX11C7	94	0	0.50	Solution	94	0	0.02	Solution	Solution	Solution	Solution	Solution
EX11C10	100	0	1.07	Solution	100	0	3.52	Solution	Solution	Solution	Solution	Solution
EX24C2	138	0	0.96	Solution	138	0	2.17	Solution	Solution	Solution	Solution	Solution
EX24C3	142	0	1.25	Solution	142	0	6.49	Solution	Solution	Solution	Solution	Solution
EX24C5	94	0	0.59	Solution	94	0	0.26	Solution	Solution	Solution	Solution	Solution
EX24C7	96	0	0.48	Solution	96	0	0.30	Solution	Solution	Solution	Solution	Solution
EX24C10	119	0	3.03	Solution	120	0.84	0.80	Solution	Solution	Solution	Solution	Solution
EX31C2	123	0	0.72	Solution	123	0	2.08	Solution	Solution	Solution	Solution	Solution
EX31C3	132	0	1.30	Solution	132	0	0.16	Solution	Solution	Solution	Solution	Solution
EX31C5	117	0	0.84	Solution	117	0	1.32	Solution	Solution	Solution	Solution	Solution
EX31C7	101	0	1.66	Solution	101	0	0.23	Solution	Solution	Solution	Solution	Solution
EX31C10	102	0	1.58	Solution	102	0	6.93	Solution	Solution	Solution	Solution	Solution
EX41C2	139	0	1.50	Solution	139	0	1.14	Solution	Solution	Solution	Solution	Solution
EX41C3	124	0	1.42	Solution	125	0.81	0.28	Solution	Solution	Solution	Solution	Solution
EX41C5	118	0	1.56	Solution	118	0	14.62	Solution	Solution	Solution	Solution	Solution
EX41C7	103	0	3.16	Solution	104	0.97	4.90	Solution	Solution	Solution	Solution	Solution
EX41C10	101	0	14.07	Solution	102	0.99	11.39	Solution	Solution	Solution	Solution	Solution
EX54C2	127	0	0.58	Solution	127	0	0.04	Solution	Solution	Solution	Solution	Solution
EX54C3	130	0	0.55	Solution	130	0	0.44	Solution	Solution	Solution	Solution	Solution
EX54C5	123	0	0.67	Solution	123	0	0.08	Solution	Solution	Solution	Solution	Solution
EX54C7	100	0	0.35	Solution	100	0	0.09	Solution	Solution	Solution	Solution	Solution
EX54C10	107	0	3.12	Solution	107	0	1.57	Solution	Solution	Solution	Solution	Solution
EX61C2	134	0	1.90	Solution	134	0	15.86	Solution	Solution	Solution	Solution	Solution
EX61C3	119	0	1.56	Solution	119	0	33.52	Solution	Solution	Solution	Solution	Solution
EX61C5	112	0	1.28	Solution	112	0	2.85	Solution	Solution	Solution	Solution	Solution
EX61C7	116	0	1.84	Solution	116	0	28.80	Solution	Solution	Solution	Solution	Solution
EX61C10	129	0	14.31	Solution	133	3.10	31.66	Solution	Solution	Solution	Solution	Solution
EX71C2	148	0	30.76	Solution	156	5.40	2.53	Solution	Solution	Solution	Solution	Solution
EX71C3	124	0	10.47	Solution	128	3.22	2.93	Solution	Solution	Solution	Solution	Solution
EX71C5	98	0	2.90	Solution	101	3.06	12	Solution	Solution	Solution	Solution	Solution
EX71C7	135	0	2.89	Solution	143	5.92	2.77	Solution	Solution	Solution	Solution	Solution
EX71C10	99	0	67.74	Solution	106	7.07	18.84	Solution	Solution	Solution	Solution	Solution
EX84C2	186	0	4.82	Solution	193	3.76	10.41	Solution	Solution	Solution	Solution	Solution
EX84C3	163	0	2.79	Solution	163	0	9.58	Solution	Solution	Solution	Solution	Solution
EX84C5	165	0	5.20	Solution	174	5.45	40.73	Solution	Solution	Solution	Solution	Solution
EX84C7	163	0	4.10	Solution	163	0	0.07	Solution	Solution	Solution	Solution	Solution
EX84C10	163	0	6.80	Solution	163	0	9.63	Solution	Solution	Solution	Solution	Solution
EX94C2	179	0	2.19	Solution	179	0	5.83	Solution	Solution	Solution	Solution	Solution
EX94C3	123	0	0.45	Solution	123	0	0.43	Solution	Solution	Solution	Solution	Solution
EX94C5	140	0	0.98	Solution	142	1.43	9.80	Solution	Solution	Solution	Solution	Solution
EX94C7	137	0	1.59	Solution	137	0	2.49	Solution	Solution	Solution	Solution	Solution
EX94C10	116	0	2.29	Solution	116	0	0.13	Solution	Solution	Solution	Solution	Solution
EX102C2	144	0	3.18	Solution	155	7.64	2.38	Solution	Solution	Solution	Solution	Solution
EX102C3	138	0	4.60	Solution	138	0	62.35	Solution	Solution	Solution	Solution	Solution
EX102C5	145	0	4.16	Solution	153	5.51	3.97	Solution	Solution	Solution	Solution	Solution
EX102C7	131	0	3.39	Solution	131	0	0.07	Solution	Solution	Solution	Solution	Solution
EX102C10	134	0	11.56	Solution	140	4.48	19.33	Solution	Solution	Solution	Solution	Solution
Avg.		0	4.72			1.19	7.76

3. Computational evaluation for the JSPT-C on new large-scale instances:

Instance: The name of the instance used for the evaluation.
S: Best makespan found by the method
GAP: Linear relaxation GAP reported by Solver (in %)
T*: Time to converge to optimality (in seconds)
T_best: Time to best found solution in the given computational time limit (in seconds)
Download: A link to the solution file

Instance	MILP (60s)				MILP (3600s)				GRASPxELS
Instance	S	GAP	T*	Download	S	GAP	T*	Download	S	T_best	Download (Run 1)	Download (Run 2)	Download (Run 3)	Download (Run 4)	Download (Run 5)
JL1	780	37	/	Solution	668	22	/	Solution	758	15.34	Solution	Solution	Solution	Solution	Solution
JL2	1158	59	/	Solution	816	39	/	Solution	792	41.49	Solution	Solution	Solution	Solution	Solution
JL3	/	/	/	Solution	1260	61	/	Solution	1049	40.32	Solution	Solution	Solution	Solution	Solution
JL4	/	/	/	Solution	1157	45	/	Solution	1235	19.42	Solution	Solution	Solution	Solution	Solution
JL5	/	/	/	Solution	1574	59	/	Solution	1421	35.56	Solution	Solution	Solution	Solution	Solution
JL6	/	/	/	Solution	2714	76	/	Solution	1893	59.86	Solution	Solution	Solution	Solution	Solution
JL7	/	/	/	Solution	1942	58	/	Solution	1808	29.00	Solution	Solution	Solution	Solution	Solution
JL8	/	/	/	Solution	3032	73	/	Solution	2416	52.55	Solution	Solution	Solution	Solution	Solution
JL9	/	/	/	Solution	/	/	/	Solution	3265	39.00	Solution	Solution	Solution	Solution	Solution