Routing and Scheduling Coast Guard Buoy Tenders
| Autor: | J. M. Meyering, D. H. King, A. K. Cline |
|---|---|
| Rok vydání: | 1992 |
| Předmět: |
Call for bids
Engineering Operations research Buoy Job shop scheduling business.industry Strategy and Management Scheduling (production processes) Dynamic priority scheduling Management Science and Operations Research Travelling salesman problem Fair-share scheduling Management of Technology and Innovation business Simulation Coast guard |
| Zdroj: | Interfaces. 22:56-72 |
| ISSN: | 1526-551X 0092-2102 |
| DOI: | 10.1287/inte.22.3.56 |
| Popis: | We applied a best-schedule heuristic for solving a large class of real-world routing and scheduling problems to the routing and scheduling of buoy maintenance in real time by the United States Coast Guard. The best schedule method reduces a routing and scheduling problem to a traveling salesman problem with non-Euclidean distances. The service windows for the activities are used to prune potential routes without calculating a detailed schedule or evaluating the cost function. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|