Comparing classical performance measures for a multi-period, two-echelon supply chain network design problem with sizing decisions

Integrated strategic and tactical supply chain planning with price-sensitive demands

“…In previous studies such as Badri et al (2013), Correia et al (2013), and Tang et al (2013), manufacturing processes of different products are not considered for capacity planning in a supply chain network. Here, to cope with this issue, capacity options for manufacturing operations of production plants are taken into consideration and expansion capacity planning is assumed in a multi-commodity supply chain.…”

Multi-period capacitated facility location under delayed demand satisfaction

“…In addition, Correia et al [10] also investigate their problem from a cost minimization perspective with additional constraints enforcing a minimum rate of demand fulfilment. For a number of test instances with small and moderate sizes, the mixed-integer linear programming (MILP) formulations proposed in [5,7,8,10,18] could be solved to optimality by a commercial MILP solver within acceptable time. Badri et al [6] developed a Lagrangian-based heuristic through dualizing a set of constraints that limit the expenditures for opening new facilities and expanding the capacity at existing locations.…”

“…[5] describe a generic model for a facility location problem arising in logistics network design that includes this feature, whereas Correia et al [10] address this issue in the design of a twoechelon production-distribution network over multiple time periods. The models developed by Badri et al [6], Bashiri et al [7], Canel and Khumawala [8], and Sousa et al [18] also allow lost sales over a dynamic horizon.…”

“…The models developed by Badri et al [6], Bashiri et al [7], Canel and Khumawala [8], and Sousa et al [18] also allow lost sales over a dynamic horizon. In the previous studies [6,7,8,10,18], strategic location and tactical logistics decisions are made under a profit maximization objective. In addition, Correia et al [10] also investigate their problem from a cost minimization perspective with additional constraints enforcing a minimum rate of demand fulfilment.…”

“…In the previous studies [6,7,8,10,18], strategic location and tactical logistics decisions are made under a profit maximization objective. In addition, Correia et al [10] also investigate their problem from a cost minimization perspective with additional constraints enforcing a minimum rate of demand fulfilment. For a number of test instances with small and moderate sizes, the mixed-integer linear programming (MILP) formulations proposed in [5,7,8,10,18] could be solved to optimality by a commercial MILP solver within acceptable time.…”