Abstract— A method for solving the job-shop scheduling problem (JSSP) integrated with dynamic and flexible facility layout planning (FLP) is proposed. The FLP is formulated as a strip packing problem under certain conditions and incorporated into the Giffler and Thompson (GT) algorithm, which is widely used to solve the JSSP. The makespan of the schedule is minimized by a tabu search algorithm. The performance of the proposed method was evaluated on benchmark datasets for FLP-integrated JSSP (FLPIJSSP), which were made anew for the FLPIJSSP. The evaluation results show that the proposed method can solve the FLPIJSSP efficiently in a reasonable time while outperforming conventional methods.

Index Terms—job-shop scheduling, facility layout planning, strip packing, metaheuristic, tabu search

Cite: Ryota Kamoshida, "Job-shop Scheduling Incorporating Dynamic and Flexible Facility Layout Planning," Journal of Industrial and Intelligent Information, Vol. 7, No. 1, pp. 12-17, June 2019. doi: 10.18178/jiii.7.1.12-17