Two-machine flow-shop scheduling to minimize total late work

檔案

日期

2006-06-01

類型

期刊名稱

ENGINEERING OPTIMIZATION

卷期與頁次

第 38 卷第 4 期,頁 501–509

ISSN

0305-215X

語言

英文

摘要

This article considers a two-machine flow-shop scheduling problem of minimizing total late work. Unlike tardiness, which is based upon the difference between the job completion time and the due date, the late work of a job is defined as the amount of work not completed by its due date. This article first shows that the problem remains non-deterministic polynomial time (NP) hard even if all jobs share a common due date. A lower bound and a dominance property are developed to design branch-and-bound algorithms. Computational experiments are conducted to assess the performance of the proposed algorithms. Numerical results demonstrate that the lower bound and dominance rule can help to reduce the computational efforts required by exploring the enumeration tree. The average deviation between the solution found by tabu search and the proposed lower bound is less than 3%, suggesting that the proposed lower bound is close to the optimal solution.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Lin, B., Lin, F., & Lee, R. (2006). Two-machine flow-shop scheduling to minimize total late work. ENGINEERING OPTIMIZATION, 38(4), 501–509. https://doi.org/10.1080/03052150500420439

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/12197