Computing inter-site distances for routing and scheduling problems
β Scribed by George B. Kleindorfer; Gray A. Kochenberger; Edward T. Reutzel
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 295 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In this article, we study algorithms for online routing and machine scheduling problems. The problems are βonlineβ because the problem instances are revealed incrementally. We first study algorithms for the online Traveling Repairman Problem (TRP), where a single server is to visit a se
In this article an approach for activity-based scheduling is presented. This approach seems to be especially useful in cases of time and resource critical problems. Based on a timenet of activities, problem features which allow a focusing of the search will be computed through propagation, making a
## Abstract The world's second largest producer of pork, Danish Crown, also provides a fresh meat supply logistics system within Denmark. This is used by the majority of supermarkets in Denmark. This article addresses an integrated vehicle routing and driver scheduling problem arising at Danish Cro