Dynamic scheduling rules for a multiproduct make-to-stock queue
Publication
, Journal Article
Perez, AP; Zipkin, P
Published in: Operations Research
1997
This paper develops a simple but effective heuristic policy for a stochastic production-inventory system, where several products share a single processor of limited capacity. Our policy combines the best features, and avoids the weaknesses, of prior approaches in the literature. Limited numerical tests suggest that the method performs well.
Duke Scholars
Published In
Operations Research
Publication Date
1997
Volume
45
Issue
6
Start / End Page
919 / 930
Related Subject Headings
- Operations Research
- 1503 Business and Management
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Perez, A. P., & Zipkin, P. (1997). Dynamic scheduling rules for a multiproduct make-to-stock queue. Operations Research, 45(6), 919–930.
Perez, A. P., and P. Zipkin. “Dynamic scheduling rules for a multiproduct make-to-stock queue.” Operations Research 45, no. 6 (1997): 919–30.
Perez AP, Zipkin P. Dynamic scheduling rules for a multiproduct make-to-stock queue. Operations Research. 1997;45(6):919–30.
Perez, A. P., and P. Zipkin. “Dynamic scheduling rules for a multiproduct make-to-stock queue.” Operations Research, vol. 45, no. 6, 1997, pp. 919–30.
Perez AP, Zipkin P. Dynamic scheduling rules for a multiproduct make-to-stock queue. Operations Research. 1997;45(6):919–930.
Published In
Operations Research
Publication Date
1997
Volume
45
Issue
6
Start / End Page
919 / 930
Related Subject Headings
- Operations Research
- 1503 Business and Management
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics