Two faster algorithms for coordination of production and batch delivery: A note

Thumbnail
Date
2015
Dewey
Recherche opérationnelle
Sujet
Supply chain scheduling; Batch delivery; Dynamic programming
Journal issue
European Journal of Operational Research
Volume
241
Number
3
Publication date
2015
Article pages
927-930
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.ejor.2014.10.005
URI
https://basepub.dauphine.fr/handle/123456789/15125
Collections
Metadata
Show full item record
Author
Agnetis, Alessandro
Aloulou, Mohamed Ali
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Fu, Liangliang
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Kovalyov, Mikhail Y.
Type
Article accepté pour publication ou publié
Abstract (EN)
This note suggests faster algorithms for two integrated production/distribution problems studied earlier, improving their complexities from O(n2V + 4) and O(n2(L + V)2) to O(n) and O(n + Vmin {V, n}) respectively, where n is the number of products to be delivered, V is the number of vehicles and L is the number of vehicle departure times.