Polynomial-time solvable cases of the capacitated multi-echelon shipping network scheduling problem with delivery deadlines

Gang Wang; Lei Lei

Year of publication:	2012
Authors:	Gang, Wang ; Lei, Lei
Published in:	International journal of production economics. - Amsterdam [u.a.] : Elsevier, ISSN 0925-5273, ZDB-ID 1092526-0. - Vol. 137.2012, 2, p. 263-271
Subject:	Multi-echelon shipping network \| scheduling \| Capacitated facilities \| Order assignment \| Polynomial-time solutions \| Scheduling-Verfahren \| Scheduling problem \| Tourenplanung \| Vehicle routing problem \| Theorie \| Theory \| Schifffahrt \| Shipping \| Heuristik \| Heuristics

Check Google Scholar |

More access options

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10009542289

A service of the