Workload minimization in re-entrant lines

G.M. Koole; S.A. Pot

doi:10.1016/j.ejor.2005.01.030

Workload minimization in re-entrant lines

G.M. Koole, S.A. Pot

Mathematics

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

This paper is concerned with workload minimization in re-entrant lines with exponential service times and pre-emptive control policies. Using a numerical algorithm called the power series algorithm we obtain nearly optimal policies for systems with up to 8 queues. We also improve considerably the implementation of the power series algorithm. © 2005 Elsevier B.V. All rights reserved.

Original language	English
Pages (from-to)	216-233
Journal	European Journal of Operational Research
Volume	174
DOIs	https://doi.org/10.1016/j.ejor.2005.01.030
Publication status	Published - 2006

Bibliographical note

KoolePot06

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/j.ejor.2005.01.030

Persistent URL (handle)

Persistent link

Cite this

@article{06c0a8bb2504499297f1b3631c7f4daf,

title = "Workload minimization in re-entrant lines",

abstract = "This paper is concerned with workload minimization in re-entrant lines with exponential service times and pre-emptive control policies. Using a numerical algorithm called the power series algorithm we obtain nearly optimal policies for systems with up to 8 queues. We also improve considerably the implementation of the power series algorithm. {\textcopyright} 2005 Elsevier B.V. All rights reserved.",

author = "G.M. Koole and S.A. Pot",

note = "KoolePot06 ",

year = "2006",

doi = "10.1016/j.ejor.2005.01.030",

language = "English",

volume = "174",

pages = "216--233",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Workload minimization in re-entrant lines

AU - Koole, G.M.

AU - Pot, S.A.

N1 - KoolePot06

PY - 2006

Y1 - 2006

N2 - This paper is concerned with workload minimization in re-entrant lines with exponential service times and pre-emptive control policies. Using a numerical algorithm called the power series algorithm we obtain nearly optimal policies for systems with up to 8 queues. We also improve considerably the implementation of the power series algorithm. © 2005 Elsevier B.V. All rights reserved.

AB - This paper is concerned with workload minimization in re-entrant lines with exponential service times and pre-emptive control policies. Using a numerical algorithm called the power series algorithm we obtain nearly optimal policies for systems with up to 8 queues. We also improve considerably the implementation of the power series algorithm. © 2005 Elsevier B.V. All rights reserved.

U2 - 10.1016/j.ejor.2005.01.030

DO - 10.1016/j.ejor.2005.01.030

M3 - Article

SN - 0377-2217

VL - 174

SP - 216

EP - 233

JO - European Journal of Operational Research

JF - European Journal of Operational Research

ER -

Workload minimization in re-entrant lines

Abstract

Bibliographical note

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this