Solving cutting scheduling problem by simulated annealing search method

• Published in: 2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) pp. 907 - 911
• Main Authors: Kuan-Ting Tung, Chih-Yu Chen, Yi-Feng Hung
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-12-2016
• Subjects: apparel manufacturing; Cooling; Cutting schedule; Fabrics; Indexes; Production facilities; Schedules; Simulated annealing
• ISSN: 2157-362X
• DOI: 10.1109/IEEM.2016.7798009

There are three important objectives for the management of apparel production. To maximize the overall throughput of the factory, the first objective is to fully utilize sewing process, the usual bottleneck. The second objective is to maximize the fabric utilization of cut order plan which is determined by the cutting department of a factory. The focus of this study is the third objective which is to minimize work-in-process inventory level under the condition that cut pieces are supplied to the following bottleneck sewing operation in time without making the bottleneck idle. The solutions of the first and second objective that serve as input data are randomly generated to the problem of this study, cutting scheduling. To efficiently solve the problem, this study tested simulated annealing for solving the problem.