Transport Scheduling with Service-Level Constraints - Complexity and Algorithms
In this paper, we study a problem arising in military transport scheduling. A military organization operates a large fleet of vehicles in a depot to serve the requests of various operational units. Each request has a fixed start and end time, and is served by a prescribed number of vehicles. We addr...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2004
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/sis_research/1128 http://www.aaai.org/Papers/AAAI/2004/AAAI04-083.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Singapore Management University |
| 語言: | English |
| 總結: | In this paper, we study a problem arising in military transport scheduling. A military organization operates a large fleet of vehicles in a depot to serve the requests of various operational units. Each request has a fixed start and end time, and is served by a prescribed number of vehicles. We address the following two problems : (1) how many vehicles are at least needed to meet a given service level of requests ; and (2) suppose we allow each request to shift its start time by a constant duration, can all the requests be met ? |
|---|