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

Warning The system is temporarily closed to updates for reporting purpose.

Karabatı, Selçuk and Akkan, Can (2006) Minimizing sum of completion times on a single machine with sequence-dependent family setup times. Journal of the operational research society, 57 (3). pp. 271-280. ISSN 0160-5682

[thumbnail of stvkaf01869.pdf] PDF
stvkaf01869.pdf

Download (229kB)

Abstract

This paper presents a branch-and-bound (B&B) algorithm for minimizing the sum of completion times in a singlemachine 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 networkformulation 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.
Item Type: Article
Uncontrolled Keywords: single machine scheduling; sum of completion times; family setups; branch and bound; Lagrangean relaxation
Subjects: T Technology > T Technology (General)
Divisions: Sabancı Business School
Depositing User: Can Akkan
Date Deposited: 20 Dec 2006 02:00
Last Modified: 04 Sep 2019 15:43
URI: https://research.sabanciuniv.edu/id/eprint/142

Actions (login required)

View Item
View Item