This note suggests faster algorithms for two integrated production/distribution problems studied earlier, improving their complexities from O(n^(2V+4)) and (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 vehicledeparture times.
Agnetis, A., Aloulou, M.A., Fu, L., Kovalyov, M.Y. (2015). Two faster algorithms for coordination of production and batch delivery: a note. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 241(3), 927-930 [10.1016/j.ejor.2014.10.005].
Two faster algorithms for coordination of production and batch delivery: a note
Agnetis, Alessandro;
2015-01-01
Abstract
This note suggests faster algorithms for two integrated production/distribution problems studied earlier, improving their complexities from O(n^(2V+4)) and (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 vehicledeparture times.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Two faster algorithms for coordination of production and batch delivery A note.pdf
non disponibili
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
270.28 kB
Formato
Adobe PDF
|
270.28 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/11365/982915