The MIP-Based Large Neighborhood Local Search Method for Large-Scale Optimization Problems with Many Constraints: Application to the Machining Scheduling

This paper addresses the problem of scheduling machining operations in a highly automated manufacturing environment, taking into account the work styles of workers. In actual manufacturing, many issues must be taken into accounts, such as constraints related to the works to be machined in the machining schedule and the conditions of workers. To derive good solutions to such a large-scale problem with many constraints in a realistic amount of computing time, we develop an optimization technique based on the MIP-based large neighborhood local search method for the machining scheduling problem. Then, computer experiments are conducted on a problem created concerning actual machining requirements to verify the validity of the proposed method.