Journal article icon

Journal article

Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: the acyclic case

Abstract:

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 production and inventory levels, that minimizes total assignment, production, and inventory costs. We propose a greedy heuristic, and prove that this greedy heuristic is asymptotically optimal in a prob...

Expand abstract

Actions


Publication date:
2004-01-01
UUID:
uuid:d0babf1e-98f1-4a70-ac06-77e25f24fe70
Local pid:
oai:eureka.sbs.ox.ac.uk:431
Deposit date:
2011-05-19

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP