1A2 TRANSPORT SCHEDULING WITH SERVICE-LEVEL CONSTRAINTS : COMPLEXITY AND ALGORITHMS(Technical session 1A : Transportation)

スポンサーリンク

概要

• 論文の詳細を見る

• 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 ?

• 一般社団法人日本機械学会の論文
• 2004-05-24

著者

• Lau Hoong

  The Logistics Institute - Asia Pacific National University Of Singapore

• Ng Kien

  The Logistics Institute - Asia Pacific National University Of Singapore

• Wu Xiaotao

  The Logistics Institute - Asia Pacific National University Of Singapore

関連論文

• 1A2 TRANSPORT SCHEDULING WITH SERVICE-LEVEL CONSTRAINTS : COMPLEXITY AND ALGORITHMS(Technical session 1A : Transportation)

スポンサーリンク