Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: the acyclic case
The multi-period single-sourcing problem that we address in this paper can be used as a tactical tool for evaluating logistics network designs in a dynamic environment. In particular, our objective is to find an assignment of customers to facilities, as well as the location, timing and size of produ...
Main Authors: | Romero-Morales, D, Romeijn, H |
---|---|
格式: | Journal article |
出版: |
2004
|
相似书籍
-
An asymptomatically optimal greedy heuristic for the multi-period single-sourcing problem: the cyclic case
由: Romero-Morales, D, et al.
出版: (2003) -
A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints
由: Romero-Morales, D, et al.
出版: (2007) -
A probablistic analysis of the multi-period single-sourcing problem
由: Romero-Morales, D, et al.
出版: (2001) -
A class of greedy algorithms for the generalized assignment problem
由: Romeijn, H, et al.
出版: (2000) -
A branch and price algorithim for the multi-period single-sourcing problem
由: Romero-Morales, D, et al.
出版: (2003)