Publication:
The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm

dc.contributor.departmentDepartment of Business Administration
dc.contributor.kuauthorAkkan, Can
dc.contributor.kuauthorKarabatı, Selçuk
dc.contributor.kuprofileFaculty Member
dc.contributor.kuprofileFaculty Member
dc.contributor.yokidN/A
dc.contributor.yokid38819
dc.date.accessioned2024-11-09T23:23:16Z
dc.date.issued2004
dc.description.abstractThis paper presents a branch-and-bound algorithm for the two-machine flowshop scheduling problem with the objective of minimizing the sum of completion times. The main feature of the branch-and-bound algorithm is a new lower bounding scheme that is based on a network formulation of the problem. With extensive computational tests, we demonstrate that the branch-and-bound algorithm can solve problems with up to 60 (45) jobs, where processing times are uniformly distributed in the [1,10] ([1,100]) range.
dc.description.indexedbyWoS
dc.description.indexedbyScopus
dc.description.issue2
dc.description.openaccessNO
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuN/A
dc.description.volume159
dc.identifier.doi10.1016/S0377-2217(03)00415-6
dc.identifier.eissn1872-6860
dc.identifier.issn0377-2217
dc.identifier.quartileQ1
dc.identifier.scopus2-s2.0-3042773342
dc.identifier.urihttp://dx.doi.org/10.1016/S0377-2217(03)00415-6
dc.identifier.urihttps://hdl.handle.net/20.500.14288/11213
dc.identifier.wos222980400011
dc.keywordsFlowshop scheduling
dc.keywordsBranch-and-bound
dc.keywordsLagrangean relaxation
dc.languageEnglish
dc.publisherElsevier Science Bv
dc.sourceEuropean Journal of Operational Research
dc.subjectManagement
dc.subjectOperations research
dc.subjectManagement science
dc.titleThe two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.authorid0000-0002-1932-7826
local.contributor.authorid0000-0001-6976-5405
local.contributor.kuauthorAkkan, Can
local.contributor.kuauthorKarabatı, Selçuk
local.publication.orgunit1College of Administrative Sciences and Economics
local.publication.orgunit2Department of Business Administration
relation.isOrgUnitOfPublicationca286af4-45fd-463c-a264-5b47d5caf520
relation.isOrgUnitOfPublication.latestForDiscoveryca286af4-45fd-463c-a264-5b47d5caf520

Files