Name
Abstract | ||
|---|---|---|
We consider production networks with stochastic activity leadtimes. When activities finish early holding costs are incurred and when end products are delivered late penalty costs are incurred. Objective is to find the activity start and finish times that minimize the total cost. We introduce the concept of a tardy path and derive the optimality equations for each node in the network. We show that under the optimal solution, for a set of nodes the tardiness probability satisfies the Newsvendor equations. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.orl.2018.10.006 | Operations Research Letters |
Keywords | Field | DocType |
Production networks,Leadtime uncertainty,Newsvendor equations | Mathematical optimization,Newsvendor model,Tardiness,Holding cost,Total cost,Mathematics | Journal |
Volume | Issue | ISSN |
46 | 6 | 0167-6377 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sjors Jansen | 1 | 0 | 0.68 |
| Zümbül Atan | 2 | 0 | 0.34 |
| Ivo J. B. F. Adan | 3 | 211 | 36.95 |
| Ton G. De Kok | 4 | 61 | 7.57 |