Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lin, BMT | en_US |
dc.contributor.author | Wu, JM | en_US |
dc.date.accessioned | 2014-12-08T15:18:31Z | - |
dc.date.available | 2014-12-08T15:18:31Z | - |
dc.date.issued | 2005-09-01 | en_US |
dc.identifier.issn | 0217-5959 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1142/S0217595905000601 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/13330 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | flowshop | en_US |
dc.subject | total completion time | en_US |
dc.subject | lower bound | en_US |
dc.subject | branch-and-bound algorithm | en_US |
dc.title | A simple lower bound for total completion time minimization in a two-machine flowshop | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1142/S0217595905000601 | en_US |
dc.identifier.journal | ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | en_US |
dc.citation.volume | 22 | en_US |
dc.citation.issue | 3 | en_US |
dc.citation.spage | 391 | en_US |
dc.citation.epage | 407 | en_US |
dc.contributor.department | 資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department | Department of Information Management and Finance | en_US |
dc.identifier.wosnumber | WOS:000232501000006 | - |
dc.citation.woscount | 4 | - |
Appears in Collections: | Articles |