| |||||||||||||
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 mt20.dat NBJOBS: 20 NBRES: 5 taskUse: [ 0 1 2 3 4 0 1 3 2 4 1 0 2 4 3 1 0 4 2 3 2 1 0 3 4 2 1 4 0 3 1 0 2 3 4 2 1 0 3 4 0 3 2 1 4 1 2 0 3 4 1 3 0 4 2 2 0 1 3 4 0 2 1 3 4 2 0 1 3 4 0 1 4 2 3 1 0 3 4 2 0 2 1 3 4 0 1 4 2 3 1 2 0 3 4 0 1 2 3 4 ] taskDuration: [ 29 9 49 62 44 43 75 69 46 72 91 39 90 12 45 81 71 9 85 22 14 22 26 21 72 84 52 48 47 6 46 61 32 32 30 31 46 32 19 36 76 76 85 40 26 85 61 64 47 90 78 36 11 56 21 90 11 28 46 30 85 74 10 89 33 95 99 52 98 43 6 61 69 49 53 2 95 72 65 25 37 13 21 89 55 86 74 88 48 79 69 51 11 89 74 13 7 76 52 45 ] | |||||||||||||
© Copyright 2023 Fair Isaac Corporation. |