Publication:
Minimizing sum of completion times on a single machine with sequence-dependent family setup times

Placeholder

School / College / Institute

Program

KU Authors

Co-Authors

Akkan, Can

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

This paper presents a branch- and- bound ( B& B) algorithm for minimizing the sum of completion times in a single-machine scheduling setting with sequence- dependent family setup times. The main feature of the B& B 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 B& B algorithm can solve problems with up to 60 jobs and 12 families, where setup and processing times are uniformly distributed in various combinations of the [ 1,50] and [ 1,100] ranges.

Source

Publisher

Palgrave Macmillan Ltd

Subject

Management, Operations research, Management science

Citation

Has Part

Source

Journal of The Operational Research Society

Book Series Title

Edition

DOI

10.1057/palgrave.jors.2601989

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

1

Views

0

Downloads

View PlumX Details