✦ LIBER ✦

Optimization for supply chain models with policies

✍ Scribed by M. Herty; C. Ringhofer

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 256 KB
Volume: 380
Category: Article
ISSN: 0378-4371
DOI: 10.1016/j.physa.2007.02.043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal policy for a closed-loop supply

Optimal policy for a closed-loop supply chain inventory system with remanufacturing

✍ Shen-Lian Chung; Hui-Ming Wee; Po-Chung Yang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 885 KB

Previous researchers have developed ways of managing forward-oriented supply chains, and gave insight to solve single-stage inventory systems. In this study, we analyze an inventory system with traditional forward-oriented material flow as well as a reverse material flow supply chain. In the reverse

An optimal ordering policy for situation

An optimal ordering policy for situations with uncertainty in supply

✍ Sujit K. Basu 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 353 KB

A supply chain design model with unrelia

A supply chain design model with unreliable supply

✍ Lian Qi; Zuo-Jun Max Shen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB

Optimal policies for controlled Markov c

Optimal policies for controlled Markov chains with a constraint

✍ Frederick J. Beutler; Keith W. Ross 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 889 KB

Optimal policies for batch, chain additi

Optimal policies for batch, chain addition polymerizations

✍ Martin E. Sacks; Soo-Il Lee; Joseph A. Biesenberger 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 723 KB

A simple heuristic for echelon policies

A simple heuristic for echelon policies in serial supply chains

✍ Kevin H. Shang; Sean X. Zhou 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 884 KB

This paper proposes a simple heuristic that generates a solution for echelon (r, nQ , T ) policies by sequentially solving a deterministic demand problem, a subproblem with fixed reorder intervals, and a subproblem with fixed batch sizes. For each of these problems, we further simplify the computati