Transport Scheduling with Service-Level Constraints - Complexity and Algorithms

Publication Type

Conference Proceeding Article

Publication Date

5-2004

Abstract

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 ?

Keywords

transport scheduling, military logistics, service constraints

Discipline

Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering

Publication

2nd International Symposium on Scheduling (ISS), 24 May 2004

First Page

11

Last Page

16

City or Country

Hyogo, Japan

Additional URL

http://www.aaai.org/Papers/AAAI/2004/AAAI04-083.pdf

Link to Full Text

Share

COinS