Journal of the Operational Research Society

, Volume 57, Issue 3, pp 271–280

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

Theoretical Paper

DOI: 10.1057/palgrave.jors.2601989

Cite this article as:
Karabatı, S. & Akkan, C. J Oper Res Soc (2006) 57: 271. doi:10.1057/palgrave.jors.2601989
  • 7 Downloads

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.

Keywords

single machine scheduling sum of completion times family setups branch-and-bound Lagrangean relaxation 

Copyright information

© Palgrave Macmillan Ltd 2005

Authors and Affiliations

  1. 1.Koç University, Rumelifeneri YoluSarıyerTurkey
  2. 2.Sabancı University, OrhanlıTuzlaTurkey

Personalised recommendations