Concurrent optimization of job shop scheduling and dynamic and flexible facility layout planning

摘要

This paper presents a method for solving job shop scheduling (JSS) integrated with dynamic and flexible facility layout planning (FLP). 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 JSS. The makespan of the schedule is minimized by the tabu search algorithm. The performance of the proposed method is evaluated on the benchmark datasets for FLP integrated JSS (FLPIJSS), which are made anew for FLPIJSS. The evaluation results show that the proposed method can solve FLPIJSS efficiently and outperforms the sequential optimization approach of JSS and FLP.