Scheduling a No-Wait Hybrid Flowshop in a Real-Time Environment
Real-time hybrid flowshop (HFS) scheduling problem with no-wait restriction in process is studied and formulated as an integer programming model. The problem has proven strongly NP-hard. Lagrangian relaxation (LR) is then presented to solve it where a composite subgradient and bundle (CSB) method is designed to update Lagrangian multipliers due to the zigzagging behavior of subgradient optimization. The CSB method performs subgradient optimization in first iterations due to its rapid convergence and runs a bundle method in late iterations accumulating the past subgradients in a bundle to achieve a better searching direction. Computational experiments are performed to show that LR combined with the CSB method converges faster and gives solutions of higher quality than that with subgradient method, especially for large-scale problems.
Real-time HFS No-wait Lagrangian Relaxation CSB Method
Xuan Hua
School of Management Engineering, Zhengzhou University, Zhengzhou, P.R. China, 450001
国际会议
郑州
英文
2008-09-20(万方平台首次上网日期,不代表论文的发表时间)