Name
Title | ||
|---|---|---|
Scheduling policies in the <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/1 make-to-stock queue |
Abstract | ||
|---|---|---|
In this paper, we analyse a production/inventory system modelled as an M/G/1 make-to-stock queue producing different products requiring different and general production times. We study different scheduling policies including the static first-come-first-served, preemptive and non-preemptive priority disciplines. For each static policy, we exploit the distributional Little's law to obtain the steady-state distribution of the number of customers in the system and then find the optimal inventory control policy and the cost. We additionally provide the conditions under which it is optimal to produce a product according to a make-to-order policy. We further extend the application area of a well-known dynamic scheduling heuristic, Myopic(T), for systems with non-exponential service times by permitting preemption. We compare the performance of the preemptive-Myopic(T) heuristic alongside that of the static preemptive-bμ rule against the optimal solution. The numerical study we have conducted demonstrates that the preemptive-Myopic(T) policy is superior between the two and yields costs very close to the optimal. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1057/jors.2008.139 | Journal of the Operational Research Society |
Keywords | Field | DocType |
make-to-stock, M/G/1 queue, Little's distributional law, static and dynamic production scheduling, inventory control | Preemption,Heuristic,Scheduling (computing),Computer science,M/G/1 queue,Queue,Operations research,Inventory control,Dynamic priority scheduling,Build to stock,Operations management | Journal |
Volume | Issue | ISSN |
61 | 1 | 1476-9360 |
Citations | PageRank | References |
4 | 0.44 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nima Sanajian | 1 | 13 | 1.52 |
| Hossein Abouee-Mehrizi | 2 | 35 | 5.52 |
| Baris Balcioglu | 3 | 72 | 7.57 |