Two Parallel Machine Energy Efficient Scheduling

Published: 6 December 2022| Version 1 | DOI: 10.17632/495ypk6sft.1
Contributors:
Çiya Aydoğan,
,

Description

There are 360 instances for the problem. Each file contains data for an instance. The name of the files represents the parameter setting used. Nx indicates there are x parts in the instance. D1 indicates the short-distance scenario in the instance. D2 indicates the long-distance scenario in the instance. D3 indicates the mixed-distance scenario in the instance. T1 indicates the case where the machines are identical and processing times are generated between 80 and 100 in the instance. T2 indicates the case where the machines are identical and processing times are generated between 40 and 140 in the instance. T3 indicates the case where machine 1 is faster than machine 2. The processing times are generated between 80 and 100 for machine 1, 100 and 120 for machine 2 in the instance. T4 indicates the case where machine 1 is faster than machine 2. The processing times are generated between 20 and 100 for machine 1, 100 and 180 for machine 2 in the instance. C1 indicates full robot move and empty robot move coefficients are equal in the instance. C2 indicates full robot move coefficient is higher than empty robot move coefficient in the instance. We have 5 replications for each parameter setting. r1, 1r2, r3, r4, and r5 indicates the replication number.

Files

Institutions

Orta Dogu Teknik Universitesi Muhendislik Fakultesi, Orta Dogu Teknik Universitesi

Categories

Industrial Engineering, Energy Efficiency, Parallel Machine Scheduling

License