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

Meral Azizoglu; Scott Webster

doi:10.1080/0020754021000042959

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

Meral Azizoglu, Scott Webster

Research output: Contribution to journal › Article › peer-review

21 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 language	English (US)
Pages (from-to)	1199-1215
Number of pages	17
Journal	International Journal of Production Research
Volume	41
Issue number	6
DOIs	https://doi.org/10.1080/0020754021000042959
State	Published - Apr 15 2003
Externally published	Yes

ASJC Scopus subject areas

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

Access to Document

10.1080/0020754021000042959

Cite this

@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 = apr,

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

SN - 0020-7543

VL - 41

SP - 1199

EP - 1215

JO - International Journal of Production Research

JF - International Journal of Production Research

IS - 6

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this