期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 51, 期 4, 页码 609-620出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2006.05.004
关键词
production-distribution planning; mixed integer programming; heuristics
In this paper, we address a strategic planning problem for a three-stage production-distribution network. The problem under consideration is a single-item, multi-supplier, multi-producer, and multi-distributor production-distribution network with deterministic demand. The objective is to minimize the costs associated with production, transportation, and inventory as well as capacity expansion costs over a given time horizon. The limitations are the production capacities of the suppliers and producers, and transportation capacities of the corresponding transportation network. On the other hand, all capacities may be increased at a fixed cost. The problem is formulated as a 0-1 mixed integer programming model. Since the problem is intractable for real life cases efficient relaxation-based heuristics are considered to obtain a good feasible solution. (c) 2006 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据