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 | Unternehmensnetzwerk | Business network | Frachtschifffahrt | Cargo shipping |
-
Methods for strategic liner shipping network design
Mulder, Judith, (2014)
-
Metaheuristic algorithm for ship routing and scheduling problems with time window
Alhamad, Khaled, (2019)
-
Tramp ship routing and scheduling with voyage separation requirements
Vilhelmsen, Charlotte, (2017)
- More ...
-
Supply chain scheduling with receiving deadlines and non-linear penalty
Wang, Gang, (2015)
-
Contribution to emission reduction of CO2 and SO2 by household biogas construction in rural China
Pei-dong, Zhang, (2007)
-
Evaluating the effects of embodied energy in international trade on ecological footprint in China
Hong, Li, (2007)
- More ...