| |||||||||||||
Solving the job-shop scheduling problem Description Solving the classical job-shop scheduling problem, formulated
Source Files By clicking on a file name, a preview is opened at the bottom of this page.
Data Files la105.dat ! +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ! Lawrence 10x5 instance (Table 3, instance 1); also called (setf1) or (F1) 666* ! 10 5 ! 1 21 0 53 4 95 3 55 2 34 ! 0 21 3 52 4 16 2 26 1 71 ! 3 39 4 98 1 42 2 31 0 12 ! 1 77 0 55 4 79 2 66 3 77 ! 0 83 3 34 2 64 1 19 4 37 ! 1 54 2 43 4 79 0 92 3 62 ! 3 69 4 77 1 87 2 87 0 93 ! 2 38 0 60 1 41 3 24 4 83 ! 3 17 1 49 4 25 0 44 2 98 ! 4 77 3 79 2 43 1 75 0 96 ! ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ NBJOBS: 10 NBRES: 5 taskUse: [ 1 0 4 3 2 0 3 4 2 1 3 4 1 2 0 1 0 4 2 3 0 3 2 1 4 1 2 4 0 3 3 4 1 2 0 2 0 1 3 4 3 1 4 0 2 4 3 2 1 0 ] taskDuration: [ 21 53 95 55 34 21 52 16 26 71 39 98 42 31 12 77 55 79 66 77 83 34 64 19 37 54 43 79 92 62 69 77 87 87 93 38 60 41 24 83 17 49 25 44 98 77 79 43 75 96 ] | |||||||||||||
© Copyright 2024 Fair Isaac Corporation. |