CLSPJE

<br> This file contains the specification of 43 instances for the CLSPJE problem. These problems were initially proposed by: Ranjbar, M., &amp; Najafian, M. (2012). A hybrid metaheuristic for concurrent layout and scheduling problem in a job shop environment. The International Journal of Advanced Manufacturing Technology, 62, 1249-1260. The original specification of the problems can be found in https://sites.google.com/site/clspje/ Every sheet contains the number of jobs and machines (and therefore, the locations including the warehouse) of each instance. The sheet contains as well the best-known value reported by Ranjbar, and the makespan obtained for the solution calculated by the LNSA algorithm. Solutions are described in two parts. A permutation with repetitions represents the sequence of operations, where the i-th repetition of a job indicates the realization of the i-th operation of that job. The second part is a permutation depicting the location assigned to every machine. The i-th element of the permutation indicates the machine placed at location i according to the proposed solution. Each sheet has three tables, one indicating the assigned machines for the sequence of operations of every job. The second table indicates the processing time of each job in every machine. The last table indicates the transportation time from location to location. This table is symmetric, and there is not transportation time at the same location (a zero diagonal). <br>