Integrated production and distribution scheduling with lifespan constraints

Autor(en): Viergutz, Christian
Knust, Sigrid 
Stichwörter: ALGORITHM; CUSTOMER SEQUENCE; DEPOT; Limited lifespan; Make-to-order production; Operations Research & Management Science; Scheduling; Supply chain management; TIME WINDOWS
Erscheinungsdatum: 2014
Herausgeber: SPRINGER
Volumen: 213
Ausgabe: 1
Startseite: 293
Seitenende: 318
We consider an integrated production and distribution scheduling problem in a make-to-order business scenario. A product with a short lifespan (e.g., perishable or seasonal) is produced at a single production facility with a limited production rate. This means that the product expires in a constant time after its production is finished. Orders are received from a set of geographically dispersed customers, where a demand for the product and a time window for the delivery is associated with each customer for the planning period. A single vehicle with non-negligible traveling times between the locations is responsible for the deliveries. Due to the limited production and distribution resources, possibly not all customers may be supplied within their time windows or the lifespan. The problem consists in finding a selection of customers to be supplied such that the total satisfied demand is maximized. We extend the work by Armstrong et al. (Annals of Operations Research 159(1):395-414, 2008) on the problem for fixed delivery sequences by pointing out an error in their branch and bound algorithm and presenting a corrected variant. Furthermore, we introduce model extensions for handling delays of the production start as well as for variable production and distribution sequences. Efficient heuristic solution algorithms and computational results for randomly generated instances are presented.
ISSN: 02545330
DOI: 10.1007/s10479-012-1197-z

Show full item record

Google ScholarTM