Multi-stage dynamic reentrant hybrid flowshop scheduling with transportation consideration
XUAN Hua
LI Bing
WANG Xue-yuan
XU Chun-qiu
Abstract：Reentrant hybrid flowshop scheduling is widely found in many industries such as semiconductor manufactur-ing and printed circuit board fabrication,where a job visits some processing stages for several times.A multi-stage dynamic reentrant hybrid flowshop problem with transportation time is studied with the objective of minimizing total weighted com-pletion time.Then an integer programming model is formulated and two improved Lagrangian relaxation(LR)algorithms are presented based on job decoupling.In these algorithms,dynamic programming is improved to speedup the resolution of job-level subproblems and interleaved subgradient optimization is designed to obtain an effective multiplier updating direction.Testing results demonstrate that the two proposed LR algorithms outperform the traditional LR in terms of so-lution quality and running time.Both of the two algorithms could get better near-optimal schedules within an acceptable computational time.
Keywords：dynamic reentrant hybrid flowshoptransportation timeLagrangian relaxationimproved dynamic pro-gramminginterleaved subgradient optimization
Publication Date：2018-03-02
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：10( 357-366 )