PUC-Rio Logo Separator image Maxwell Logo Research Data Main Logo
 
Contrast
Reduce Font
Normal Font
Enlarge Font

TEXT FILE

Title: INSTANCES FOR A COMPLEX MACHINE SCHEDULING PROBLEM
Author(s): DAVI ZERPINI MECLER
RAFAEL MARTINELLI PINTO
VICTOR ABU-MARRUL CARNEIRO DA CUNHA
Vocabulary: FAMILY SCHEDULING
LOT
METAHEURISTICS
Data Generation Method:
EXPERIMENTAL - The Benchmark Set combines concepts from different instance generation processes in the scheduling literature. We generated 3 instances for each combination of the number of machines m = {5,10}, the number of operations o = {50,75,100}, the number of jobs n = o q, where q = {3,5}, and the number of families f = {3,5}. Therefore, the set is composed of 72 instances in total. Processing times follow a discrete uniform distribution U(1,100). Family setup times follow a discrete uniform distribution U(10,30). Job s weights are drawn from a discrete uniform distribution U(1,10). Release dates for machines following a discrete uniform distribution U(0,MR), where MR is the maximum release date computed as the sum of all operations processing times plus a family setup time for each operation divided by the number of machines. The machine s capacities follow a discrete uniform distribution U(10,15), while the operation s sizes are drawn from a discrete uniform distribution U(1,5).