在本篇論文裡, 我們提出一個"油輪排程規畫"的方法。處理在計畫期間中, 有關原油供應商的供給, 油輪的運輸與需求地儲油庫存貨管理的問題。藉由一些性質的探討來分析運輸排程與存貨管理。由供應油商契約量中供應量的情形, 提出最大累積可提運量表, 並藉由該表來輔助我們做排程; 由分油的概念與訂貨週期的制定, 分析運輸工具的排程狀況與儲油庫油量存貨的關係; 由運輸與儲油庫油料之間的互動關係, 提出管理的方案; 最後再藉由理想存貨量的關念來確立租用臨時運輸工具的可行性。並藉由所提出的性質來處理租用運輸工具的排程。在各個階段的處理過程中, 包括分析限制條件是否滿足的情形等, 總共提出了四個演算法, 找出滿足整個問題限制條件的可行排程。最後, 引用實務上的例子, 來說明油輪排程規畫的方法。 / In this paper, we consider an inventory problem of which the lead time depends on vehicles chosen from a restricted set. The inventory itself hasother constraints that must satisfy the demand and capacity limitation. Inspecific, a problem that considers scheduling oil tankers for transportingcrude oils from supplies to a refinery is represented. With the help of some properties discovered while analyzing the problem of oil tanker scheduling with inventory management, such as largest accumulated supplies from oil suppliers, demand intervals and reorder intervals, and an ideal inventory level, we develope an oil tanker scheduling model to determine each vehicle's schedule and satisfy all constraints. The model consists of four heuristic algorithms which are described step by step asthe solution procedure. A realworld example from an oil company is used to illustrate the four algorithms and suggest a feasible schedule for transporting crude oils. In short, we not only give 1 overall viewpoint of inventory and transportation problems but also provide a heuristic procedurefor solving it.