Cell Formation Cell layout and scheduling problem

Speed of robots (r and f value) /2/
Clearence between machines (G value)/1/

In these instances, the number of machines is set to 3, 7, 10, 15 and 20 respectively. A file is given for each machine.

Since these instances involve the different types of combinations (the number of machines, parts, routes and cells), they can be simply named intuitively. For example, the instance "3M5P2R2C" means that there are 3 machines, 5 parts, 2 routes and 2 cells. 2 test problems are generated for each properties. The instances with "3M5P2R2C'" is the second test problem for the related properties.

In test problems, there has been 7 sheets. Sheet 1 is the O_(p,r) parameter. Sheet 2 is routes of parts considering the number of routes. For example, if there has been 2 routes the first row is the first route of part 1 and second row is the second route of part 1. Sheet 3 is the Cx_m and Cy_m values. Sheet 4 is the P_(p,r,s,m) values. Sheet 5 is the FL and FW values. Sheet 6 is for r and f values. Finally sheet 7 is the clearence value.

102 test problems are generated.