Development of a new approach for deterministic supply chain network design

This paper proposes a mixed integer linear programming model and solution algorithm for solving supply chain network design problems in deterministic, multi-commodity, single-period contexts. The strategic level of supply chain planning and tactical level planning of supply chain are aggregated to p...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 198; číslo 1; s. 121 - 128
Hlavní autoři:	Mohammadi Bidhandi, Hadi, Mohd. Yusuff, Rosnah, Megat Ahmad, Megat Mohamad Hamdan, Abu Bakar, Mohd Rizam
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.10.2009 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Applied sciences Benders’ decomposition Combinatorial optimization Decision making models Decision theory. Utility theory Exact sciences and technology Facilities planning and design Facilities planning and design Supply chain network design Combinatorial optimization Mixed integer linear programming Benders' decomposition Surrogate constraints Flows in networks. Combinatorial problems Integer programming Linear programming Logistics Mathematical programming Mixed integer linear programming Operational research and scientific management Operational research. Management science Optimization algorithms Studies Supply chain management Supply chain network design Supply chains Surrogate constraints Benders’ decomposition Supply chain network design Facilities planning and design Mixed integer linear programming Combinatorial optimization Surrogate constraints Partition method Decision making Linear programming Mixed integer programming Benders' decomposition Modeling Location problem Linear model Zero one programming Substitution Warehousing Inequality constraint NP hard problem Relaxation method Supplier Metric Plant layout Planning Logistics
ISSN:	0377-2217, 1872-6860
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!