Polynomial-time solvable cases of the capacitated multi-echelon shipping network scheduling problem with delivery deadlines
| 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 |
-
Babu, Soudagar A.K. Irfan, (2015)
-
A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping
Hansen, Jone R., (2022)
-
Hwang, Seung-June, (2024)
- More ...
-
Supply chain scheduling with receiving deadlines and non-linear penalty
Wang, Gang, (2015)
-
The effects of quantitative easing announcements on the mortgage market : an event study approach
Wang, Gang, (2019)
-
Wang, Gang, (2020)
- More ...