Title: Batch scheduling in differentiation flow shops for makespan minimisation
Authors: Huang, Ting-Chih
Lin, Bertrand M. T.
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
Keywords: flow shop scheduling;mass customization;scheduling;makespan
Issue Date: 1-Sep-2013
Abstract: This paper considers a two-stage three-machine differentiation flow shop that comprises a common machine at stage 1 and two independent dedicated machines at stage 2. Two types of jobs are to be processed. All jobs must visit the stage-1 machine, and then the jobs of each type proceed to their dedicated machine for stage-2 processing. The stage-1 machine processes the jobs in batches, each of which, whenever formed, requires a constant setup time. The objective is to find a schedule that attains the minimum makespan. While the problem is strongly NP-hard, we investigate the case where the processing sequences of the two types of jobs are given and fixed. A polynomial-time dynamic programming algorithm is designed to solve this problem. We then deploy this algorithm to compute the lower bounds of the general problem.
URI: http://dx.doi.org/10.1080/00207543.2013.784418
ISSN: 0020-7543
DOI: 10.1080/00207543.2013.784418
Volume: 51
Issue: 17
Begin Page: 5073
End Page: 5082
Appears in Collections:Articles

Files in This Item:

  1. 000323920500003.pdf