Name
Title | ||
|---|---|---|
Integer programming solution approach for inventory-production–distribution problems with direct shipments |
Abstract | ||
|---|---|---|
We construct an integrated multi-period inventory-production-distribution replenishment plan for three-stage supply chains. The supply chain maintains close-relationships with a small group of suppliers, and the nature of the products (bulk, chemical, e tc.) makes it more economical to rely upon a direct shipment, full-truck load distribution polic y between supply chain nodes. In this paper, we formulate the problem as an integer linear program that proves challenging to solve due to the general integer variables associated with the distributio n requirements. We propose new families of valid cover inequalities, and we derive a practical closed- form expression for generating them, upon the determination of a single parameter. We study their performances through benchmarking several branch-and-bound and branch-and-cut approaches. Computational testing is done using a large-scale planning problem faced by a North American company. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1111/j.1475-3995.2008.00621.x | ITOR |
Keywords | Field | DocType |
p roduction-distribution planning,binary-integer knapsack constraint,cover inequality,supply chain management,supply chain,branch and cut,load distribution,branch and bound,product distribution | Direct shipment,Mathematical optimization,Branch and price,Branch and cut,Integer programming,Supply chain management,Supply chain,Linear programming,Mathematics,Operations management,Benchmarking | Journal |
Volume | Issue | Citations |
15 | 3 | 4 |
PageRank | References | Authors |
0.42 | 21 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miguel A. Lejeune | 1 | 253 | 21.95 |
| François Margot | 2 | 768 | 45.21 |