Journal article
Routing and Scheduling on a Shoreline with Release Times
Department of Ocean Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts 021391
Management Science Department, Northeastern University, Boston, Massachusetts 021152
Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 021393
Kion Technology Inc., Seoul, Republic of Korea4
In this paper we examine computational complexity issues and develop algorithms for a class of "shoreline" single-vehicle routing and scheduling problems with release time constraints. Problems in this class are interesting for both practical and theoretical reasons. From a practical perspective, these problems arise in several transportation environments.
For instance, in the routing and scheduling of cargo ships, the routing structure is "easy" because the ports to be visited are usually located along a shoreline. However, because release times of cargoes at ports generally complicate the routing structure, the combined routing and scheduling problem is nontrivial.
For the straight-line case (a restriction of the shoreline case), our analysis shows that the problem of minimizing the maximum completion time can be solved exactly in quadratic time by dynamic programming. For the shoreline case we develop and analyze heuristic algorithms. We derive data-dependent worst-case performance ratios for these heuristics that are bounded by constant.
We also discuss how these algorithms perform on practical data.
Language: | English |
---|---|
Publisher: | Institute of Management Science |
Year: | 1990 |
Pages: | 212-223 |
ISSN: | 15265501 and 00251909 |
Types: | Journal article |
DOI: | 10.1287/mnsc.36.2.212 |