Real-Time Near-Optimal Scheduling With Rolling Horizon for Automatic Manufacturing Cell

• Main Authors: Chih-Hua Hsu, Haw-Ching Yang
• Format: Article
• Language: English
• Published: IEEE 2017-01-01
• Series: IEEE Access
• Subjects: Earliness and tardiness cost; mixed integer linear programming; real-time scheduling; rolling horizon optimization; setup times; single machine scheduling
• Online Access: https://ieeexplore.ieee.org/document/7589021/

This paper presents position-based optimization methods to schedule the production of automatic cells of a wheel manufacturing factory. Real-time schedule is challenging when a cell is interrupted by various order changes. Given a sequence of orders to be scheduled, it is sorted based on an earliest due day policy, a mixed integer linear programming model is formulated, and then rolling-horizon optimization methods are used to timely find the near-optimal schedule by minimizing earliness and tardiness penalties with setup times of a manufacturing cell. In addition, an original schedule can be partial rescheduled with the preset order sequence by using the linear programming model. Experimental results show that the proposed method enables a wheel manufacturing cell to reschedule its three to five daily orders within the cycle time of a rim when there exist order changes, e.g., rush orders and customized orders. Hence, these proposed methods are promising to promptly derive the near-optimal schedule for satisfying the objective of mass customization for industry 4.0.