Scheduling parallel machines to minimize weighted flowtime with family set-up times


Azizoglu M. , Webster S.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol.41, no.6, pp.1199-1215, 2003 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 41 Issue: 6
  • Publication Date: 2003
  • Doi Number: 10.1080/0020754021000042959
  • Title of Journal : INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Page Numbers: pp.1199-1215

Abstract

We describe and evaluate several branch-and-bound algorithms for an identical parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted flowtime. The algorithms differ by choice of lower bound method. Computational results suggest conditions favourable to a particular algorithm as well as the range of problem sizes that can be optimally solved in reasonable CPU time.