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

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.

MoreLess

Year of publication:	2015
Authors:	Agnetis, Alessandro ; Aloulou, Mohamed Ali ; Fu, Liang-Liang ; Kovalyov, Mikhail Y.
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 241.2015, 3, p. 927-930
Publisher:	Elsevier
Subject:	Supply chain scheduling \| Batch delivery \| Dynamic programming

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011117489