| |||||||||||||||||
Jobshop scheduling - Generating start solutions via parallel computation Description The job shop problem is solved by sequentially sequencing tasks on a single machine and then loading this
initial schedule as an initial integer solution (jobshopas.mos). A parallel version of the algorithm is
also presented. In the parallel version, the single machine sequencing models are solved concurrently, exchanging data in memory with the parent model.
Source Files By clicking on a file name, a preview is opened at the bottom of this page.
Data Files mt06.dat ! +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ! Fisher and Thompson 6x6 instance alternate name (mt06) 55* ! 6 6 ! JOB 1 : 2 1 0 3 1 6 3 7 5 3 4 6 ! JOB 2 : 1 8 2 5 4 10 5 10 0 10 3 4 ! JOB 3 : 2 5 3 4 5 8 0 9 1 1 4 7 ! JOB 4 : 1 5 0 5 2 5 3 3 4 8 5 9 ! JOB 5 : 2 9 1 3 4 5 5 4 0 3 3 1 ! JOB 6 : 1 3 3 3 5 9 0 10 4 4 2 1 ! ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ NBJOBS: 6 NBRES: 6 taskUse: [ 2 0 1 3 5 4 1 2 4 5 0 3 2 3 5 0 1 4 1 0 2 3 4 5 2 1 4 5 0 3 1 3 5 0 4 2 ] taskDuration: [ 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 ] | |||||||||||||||||
© Copyright 2024 Fair Isaac Corporation. |