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

Meral Azizoglu, Scott Webster

Research output: Contribution to journalArticle

18 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)1199-1215
Number of pages17
JournalInternational Journal of Production Research
Volume41
Issue number6
DOIs
StatePublished - Apr 15 2003
Externally publishedYes

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Scheduling parallel machines to minimize weighted flowtime with family set-up times'. Together they form a unique fingerprint.

  • Cite this