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

Meral Azizoglu, Scott Webster

Research output: Contribution to journalArticle

18 Citations (Scopus)

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

Fingerprint

Scheduling
Program processors
Flow time
Setup times
Parallel machine scheduling
Lower bounds
Branch and bound algorithm

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research

Cite this

Scheduling parallel machines to minimize weighted flowtime with family set-up times. / Azizoglu, Meral; Webster, Scott.

In: International Journal of Production Research, Vol. 41, No. 6, 15.04.2003, p. 1199-1215.

Research output: Contribution to journalArticle

@article{700a899632a14d50a9f3b3b2980ef1fe,
title = "Scheduling parallel machines to minimize weighted flowtime with family set-up times",
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.",
author = "Meral Azizoglu and Scott Webster",
year = "2003",
month = "4",
day = "15",
doi = "10.1080/0020754021000042959",
language = "English (US)",
volume = "41",
pages = "1199--1215",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "6",

}

TY - JOUR

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

AU - Azizoglu, Meral

AU - Webster, Scott

PY - 2003/4/15

Y1 - 2003/4/15

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0242274320&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242274320&partnerID=8YFLogxK

U2 - 10.1080/0020754021000042959

DO - 10.1080/0020754021000042959

M3 - Article

AN - SCOPUS:0242274320

VL - 41

SP - 1199

EP - 1215

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 6

ER -