An Efficient Branch-And-Bound Algorithm For The Two-Machine Bicriteria Flowshop Scheduling Problem

DSpace/Manakin Repository

Search OPUS


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Yeh, W
dc.date.accessioned 2012-02-02T04:19:34Z
dc.date.issued 2001-01
dc.identifier.citation Journal Of Manufacturing Systems, 2001, 20 (2), pp. 113 - 123
dc.identifier.issn 0278-6125
dc.identifier.other C1UNSUBMIT en_US
dc.identifier.uri http://hdl.handle.net/10453/14513
dc.description.abstract In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-bound algorithm is presented. The proposed algorithm and the existing ones are compared on randomly generated problems. The computational analysis on problems up to 20 jobs shows that the proposed branch-andbound algorithm is more efficient than the others, including the best-known algorithm. The upper bound used in the proposed branch-and-bound algorithm, a two-phase hybrid heuristic method, is also shown to be efficient. Its overall average error on the randomly generated problems is 0.000139, that is, almost equal to the optimal solution.
dc.format Esha Dutt
dc.publisher Soc Manufacturing Engineers
dc.relation.isbasedon 10.1016/S0278-6125(01)80034-0
dc.subject Scheduling, Flowshop, Bicriteria, Branch-andBound Algorithm, Heuristic Algorithm, Industrial Engineering & Automation
dc.subject Scheduling, Flowshop, Bicriteria, Branch-andBound Algorithm, Heuristic Algorithm; Industrial Engineering & Automation
dc.title An Efficient Branch-And-Bound Algorithm For The Two-Machine Bicriteria Flowshop Scheduling Problem
dc.type Journal Article
dc.parent Journal Of Manufacturing Systems
dc.journal.volume 2
dc.journal.volume 20
dc.journal.number 2 en_US
dc.publocation Dearborn en_US
dc.identifier.startpage 113 en_US
dc.identifier.endpage 123 en_US
dc.cauo.name FEIT.Faculty of Engineering & Information Technology en_US
dc.conference Verified OK en_US
dc.for 0102 Applied Mathematics
dc.personcode 106463 en_US
dc.percentage 100 en_US
dc.classification.name Applied Mathematics en_US
dc.classification.type FOR-08 en_US
dc.edition en_US
dc.custom en_US
dc.date.activity en_US
dc.location.activity ISI:000171459300005 en_US
dc.location.activity ISI:000171459300005
dc.location.activity ISI:000171459300005
dc.location.activity ISI:000171459300005
dc.description.keywords Scheduling, Flowshop, Bicriteria, Branch-andBound Algorithm, Heuristic Algorithm en_US
dc.description.keywords Scheduling, Flowshop, Bicriteria, Branch-andBound Algorithm, Heuristic Algorithm
dc.description.keywords Scheduling, Flowshop, Bicriteria, Branch-andBound Algorithm, Heuristic Algorithm
dc.description.keywords Scheduling, Flowshop, Bicriteria, Branch-andBound Algorithm, Heuristic Algorithm
dc.staffid en_US
dc.staffid 106463 en_US
pubs.embargo.period Not known
pubs.organisational-group /University of Technology Sydney
pubs.organisational-group /University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group /University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software


Files in this item

This item appears in the following Collection(s)

Show simple item record