Energy Efficient Scheduling in a Robotic Cell with a Material Handling Robot Serving Two Parallel Machines
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 5 and 45 in the instance. T2 indicates the case where the machines are identical and processing times are generated between 5 and 90 in the instance. T3 indicates the case where machine 1 is faster than machine 2. The processing times are generated between 5 and 45. T4 indicates the case where machine 2 is faster than machine 1. The processing times are generated between 5 and 45. 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.