A simple lower bound for total completion time minimization in a two-machine flowshop

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2005-09-01

類型

期刊名稱

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH

卷期與頁次

第 22 卷第 3 期,頁 391–407

ISSN

0217-5959

語言

英文

摘要

The purpose of this study is to present a simple lower bound to facilitate the development of branch-and-bound algorithms for the minimization of total completion time in a two-machine flowshop. The studied problem is known to be strongly NP-hard. In the literature, several lower bounds have been proposed. The bounding technique addressed in this paper is based upon a concept about rearrangement of the parameters of the input instance. The technique is intrinsically simple for computer implementations. We conduct computational experiments for problems with 10-65 jobs. Numerical results from our computational study indicate that the new scheme is very effective in reducing the execution time needed for composing optimal solutions.

所屬典藏

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

引用此條目

Lin, B., & Wu, J. (2005). A simple lower bound for total completion time minimization in a two-machine flowshop. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 22(3), 391–407. https://doi.org/10.1142/S0217595905000601

BibTeX RIS

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

分享

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