In the single-vehicle scheduling problem with time window constraints, a vehicle has to visit a set of sites on a graph, and each site must be visited after its ready time but no later than its deadline. The goal is to minimize the total time taken to visit all sites. We prove the conjecture propose
β¦ LIBER β¦
Vehicles scheduling with sliding time windows
β Scribed by Jacques A. Ferland; Luc Fortin
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 906 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Single-vehicle scheduling with time wind
β
Gilbert H. Young; Chi-Lok Chan
π
Article
π
1999
π
Springer US
π
English
β 164 KB
Multi-depot vehicle scheduling problems
β
Guy Desaulniers; June Lavigne; FranΓ§ois Soumis
π
Article
π
1998
π
Elsevier Science
π
English
β 158 KB
Airport Gate Scheduling with Time Window
β
A. Lim; B. Rodrigues; Y. Zhu
π
Article
π
2005
π
Springer Netherlands
π
English
β 284 KB
Robust ship scheduling with multiple tim
β
Marielle Christiansen; Kjetil Fagerholt
π
Article
π
2002
π
John Wiley and Sons
π
English
β 109 KB
The split delivery vehicle scheduling pr
β
P.W. Frizzell; J.W. Giffin
π
Article
π
1995
π
Elsevier Science
π
English
β 907 KB
The quay crane scheduling problem with t
β
Frank Meisel
π
Article
π
2011
π
John Wiley and Sons
π
English
β 500 KB
The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time wi