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

Placeholder

School / College / Institute

Program

KU Authors

Co-Authors

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

This 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.

Source

Publisher

Elsevier Science Bv

Subject

Management, Operations research, Management science

Citation

Has Part

Source

European Journal of Operational Research

Book Series Title

Edition

DOI

10.1016/S0377-2217(03)00415-6

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details