A column generation-based exact solution method for seru scheduling problems

This paper attempts to address production scheduling problems in seru production systems (SPS), which is a new-type manufacturing system emanating from Japanese electronic assembly industry. As a typical parallel production system, SPS has high efficiency, good flexibility, and rapid responsiveness, which are achieved by reconfiguring serus, increasing, or decreasing workers to adjust the output in practical volatile markets. The seru scheduling problem in this paper is formulated as an integer programming (IP) model to minimize the total weighted completion time (TWCT). Then, by employing the Dantzig-Wolfe decomposition, the proposed IP model is reformulated into a set partitioning problem with a master problem and several subproblems. A branch-and-bound (B&B) algorithm is designed, and each node in a B&B tree is a linear relaxation problem (LRP) of the set partitioning problem. The LRP is solved by a column generation approach, in which each column is generated to represent a schedule of the seru in SPS based on solving the subproblems. Computational experiments are conducted, and the results indicate that the proposed column generation-based exact solution method is promising in solving the seru scheduling problem effectively.(c) 2021 Elsevier Ltd. All rights reserved.