On-line machine scheduling with batch setups

Lele Zhang; Andrew Wirth

doi:10.1007/s10878-009-9211-3

On-line machine scheduling with batch setups

Lele Zhang, Andrew Wirth

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

2 Citations (Scopus)

Abstract

We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch start and complete together, and a constant setup is prior to each batch. The objective is to minimize the total completion time of all jobs. We primarily consider the special cases of these problems with identical processing times, for which efficient on-line heuristics are proposed and their competitive performance is evaluated.

Original language	English
Pages (from-to)	285 - 306
Number of pages	22
Journal	Journal of Combinatorial Optimization
Volume	20
Issue number	3
DOIs	https://doi.org/10.1007/s10878-009-9211-3
Publication status	Published - 2010
Externally published	Yes

Access to Document

10.1007/s10878-009-9211-3

Cite this

@article{40563387fdff4d8ea94e2da0bef62c7f,

title = "On-line machine scheduling with batch setups",

abstract = "We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch start and complete together, and a constant setup is prior to each batch. The objective is to minimize the total completion time of all jobs. We primarily consider the special cases of these problems with identical processing times, for which efficient on-line heuristics are proposed and their competitive performance is evaluated.",

author = "Lele Zhang and Andrew Wirth",

year = "2010",

doi = "10.1007/s10878-009-9211-3",

language = "English",

volume = "20",

pages = "285 -- 306",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer-Verlag London Ltd.",

number = "3",

}

TY - JOUR

T1 - On-line machine scheduling with batch setups

AU - Zhang, Lele

AU - Wirth, Andrew

PY - 2010

Y1 - 2010

N2 - We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch start and complete together, and a constant setup is prior to each batch. The objective is to minimize the total completion time of all jobs. We primarily consider the special cases of these problems with identical processing times, for which efficient on-line heuristics are proposed and their competitive performance is evaluated.

AB - We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch start and complete together, and a constant setup is prior to each batch. The objective is to minimize the total completion time of all jobs. We primarily consider the special cases of these problems with identical processing times, for which efficient on-line heuristics are proposed and their competitive performance is evaluated.

UR - http://www.springerlink.com/content/f586t6725041nm61/?MUD=MP

U2 - 10.1007/s10878-009-9211-3

DO - 10.1007/s10878-009-9211-3

M3 - Article

SN - 1382-6905

VL - 20

SP - 285

EP - 306

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 3

ER -

On-line machine scheduling with batch setups

Abstract

Access to Document

Other files and links

Cite this