 A modified column generation algorithm for scheduling problem of reentrant hybrid flow shops with queue constraintsBing-Hai Zhou and Ke Wang International Journal of Operational Research, 2020, vol. 39, issue 4, 439-458 Abstract: This paper investigates a two-stage reentrant hybrid flow shops scheduling problem. In this problem, each product is processed layer by layer with different processing time. To be more practical, the queue time between the parallel machines and the batch processing machine is restricted. The objective is to minimise the total completion time. A column generation algorithm is proposed to solve the scheduling problem by decomposing this problem into main problem and workpiece level sub-problem. In the proposed method, dynamic programming with multiple decision-making is designed to solve each sub-problem and the adaptive accelerating strategy is provided creatively to effectively improve the convergence of the algorithm. In the branch-and-bound method to generate feasible solution, the innovative method of neighbourhood mutation is employed. Computational experiments demonstrate that the proposed method for the two-stage hybrid flow shops problem is quite stable and effective compared with other conventional formulation. Keywords: reentrant hybrid flow shops; queue time; column generation; dynamic programming; branch-and-bound. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:39:y:2020:i:4:p:439-458 Access Statistics for this article More articles in International Journal of Operational Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.