Minimizing the total weighted delivery time in container transportation scheduling

DOI10.1002/nav.21480zbMath1407.90157OpenAlexW2035270215MaRDI QIDQ3120557

Joseph Y.-T. Leung, Byung-Cheon Choi, Kangbok Lee, Dirk Briskorn, Michael L. Pinedo

Publication date: 5 March 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21480

zbMATH Keywords

computational complexitystrongly NP-hardpolynomially solvablecontainer schedulingtotal weighted delivery time

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Schedule design for liner services under vessel speed reduction incentive programs ⋮ Integrated planning of ship deployment, service schedule and container routing

This page was built for publication: Minimizing the total weighted delivery time in container transportation scheduling