標題: Two-machine flow shop scheduling of polyurethane foam production
作者: Lin, Bertrand M. T.
Lin, Y-Y
Fang, K-T
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
關鍵字: Polyurethane foam;Flow shop;Precedence constraints;Branch-and-bound algorithm;Heuristic;Iterative local search
公開日期: 1-一月-2013
摘要: This paper studies a two-machine flow shop scheduling problem with a supporting precedence relation. The model originates from a real production context of a chemical factory that produces foam-rubber products. We extend the traditional two-machine flow shop by dividing the operations into two categories: supporting tasks and regular jobs. In the model, several different compositions of foam rubber can be mixed at the foam blooming stage, and products are processed at the manufacturing stage. Each job (product) on the second machine cannot start until its supporting tasks (parts) on the first machine are all finished and the second machine is not occupied. The objective is to find a schedule that minimizes the total job completion time. The studied problem is strongly NP-hard. In this paper, we propose a branch-and-bound algorithm incorporating a lower bound and two dominance rules. We also design a simple heuristic and an iterated local search (ILS) algorithm to derive approximate solutions. The performances of the proposed algorithms are examined through computational experiments. (C) 2012 Elsevier B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/j.ijpe.2012.08.006
http://hdl.handle.net/11536/20792
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2012.08.006
期刊: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume: 141
Issue: 1
起始頁: 286
結束頁: 294
顯示於類別:期刊論文


文件中的檔案:

  1. 000312759600026.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。