.png){kind=icon}
.png){kind=icon}
Return
Workload minimization in re-entrant lines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.01.030.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
dynamic programming
re-entrant lines
power series algorithm
curse of dimensionality
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available