Instance ft06



Basic information


Name ft06
Number of jobs 6
Number of machines 6
Optimal value 55
Lower bound reference Florian et al. [20]
Upper bound reference Florian et al. [20]
From set Fisher and Thompson
Reference Fisher and Thompson [18]




References


[5] Egon Balas. Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Algorithm.
Operations Research, 17.6: 941-957, 1969.
doi: 10.1287/opre.17.6.941 jstor: 168317
[18] H. Fisher and G. L. Thompson. Probabilistic learning combinations of local job-shop scheduling rules.
In: Industrial Scheduling: 225-251. ed. by J.F. Muth and G.L. Thompson. Prentice Hall, 1963.
oclc: 781815542
[19] M. Florian, P. Trepant, and G. McMahon. An Implicit Enumeration Algorithm for the Machine Sequencing Problem.
Management Science, 17.12: B-782-B-792, 1971.
doi: 10.1287/mnsc.17.12.B782 jstor: 2629469
[20] M. Florian, P. Trepant, and G. McMahon. [19] using algorithms of Schrage [48] and Balas [5].
[48] Linus Schrage. Solving Resource-Constrained Network Problems by Implicit Enumeration-Nonpreemptive Case.
Operations Research, 18.2: 263-278, 1970.
doi: 10.1287/opre.18.2.263 jstor: 168683




Solutions


Found 53 different optimal solutions, which proved to be all optimal solutions. download Download the operation order of these solutions as text file (See Solutions file) or the same file Zipped download.

Go to the first solution page, jump directly to page number: or go to the overview of all solution pages





Instance specification


Standard specification

Specification according to the standard specification
6 6
2 1 0 3 1 6 3 7 5 3 4 6
1 8 2 5 4 10 5 10 0 10 3 4
2 5 3 4 5 8 0 9 1 1 4 7
1 5 0 5 2 5 3 3 4 8 5 9
2 9 1 3 4 5 5 4 0 3 3 1
1 3 3 3 5 9 0 10 4 4 2 1
download Download as text file.

Taillard specification

Specification according to the Taillard specification
6 6
1 3 6 7 3 6
8 5 10 10 10 4
5 4 8 9 1 7
5 5 5 3 8 9
9 3 5 4 3 1
3 3 9 10 4 1
3 1 2 4 6 5
2 3 5 6 1 4
3 4 6 1 2 5
2 1 3 4 5 6
3 2 5 6 1 4
2 4 6 1 5 3
download Download as text file.

Per operation

Specification per operation (operation numbering)

Operation nr. Job Machine Operation Time Job order
1 1 3 1 1
2 2 2 8 1
3 3 3 5 1
4 4 2 5 1
5 5 3 9 1
6 6 2 3 1
7 1 1 3 2
8 2 3 5 2
9 3 4 4 2
10 4 1 5 2
11 5 2 3 2
12 6 4 3 2
13 1 2 6 3
14 2 5 10 3
15 3 6 8 3
16 4 3 5 3
17 5 5 5 3
18 6 6 9 3
19 1 4 7 4
20 2 6 10 4
21 3 1 9 4
22 4 4 3 4
23 5 6 4 4
24 6 1 10 4
25 1 6 3 5
26 2 1 10 5
27 3 2 1 5
28 4 5 8 5
29 5 1 3 5
30 6 5 4 5
31 1 5 6 6
32 2 4 4 6
33 3 5 7 6
34 4 6 9 6
35 5 4 1 6
36 6 3 1 6