Large neighborhood local search method with MIP techniques for large-scale machining scheduling with many constraints

Abstract

AbstractThis study addresses the problem of scheduling machining operations in a highly automated manufacturing environment while considering the work styles of workers. In actual manufacturing, many aspects of the operation must be considered, such as constraints related to the works to be machined in the machining schedule and the states of the workers. To derive good solutions for such a large-scale problem with many constraints within a realistic amount of computation time, we develop an optimization technique based on a mixed-integer programming (MIP)-based large neighborhood local search method for the machining scheduling problem. Then, computer experiments on a problem based on actual machining requirements are performed to verify the validity of the proposed method.