Title: Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence
Authors: Hwang, F. J.
Lin, B. M. T.
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
Keywords: assembly flowshop;batch scheduling;fixed sequence;dynamic programming
Issue Date: 1-Jun-2012
Abstract: This paper discusses a two-stage assembly-type flowshop scheduling problem with batching considerations subject to a fixed job sequence. The two-stage assembly flowshop consists of m stage-1 parallel dedicated machines and a stage-2 assembly machine which processes the jobs in batches. Four regular performance metrics, namely, the total completion time, maximum lateness, total tardiness, and number of tardy jobs, are considered. The goal is to obtain an optimal batching decision for the predetermined job sequence at stage 2. This study presents a two-phase algorithm, which is developed by coupling a problem-transformation procedure with a dynamic program. The running time of the proposed algorithm is O(mn + n(5)), where n is the number of jobs. Journal of the Operational Research Society (2012) 63, 839-845. doi:10.1057/jors.2011.90 Published online 21 September 2011
URI: http://hdl.handle.net/11536/15955
ISSN: 0160-5682
Journal: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume: 63
Issue: 6
End Page: 839
Appears in Collections:Articles


Files in This Item:

  1. 000303920200012.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.