|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|4959460||1364862||2018||13 صفحه PDF||ندارد||دانلود رایگان|
â¢First study on multi-product pipeline scheduling with transition technologies.â¢Modeling of product transitions by interfaces and physical product separation.â¢Variant of Economic Lot Scheduling Problem applied for pipeline scheduling. Proposal of a heuristic for pipeline scheduling with batch size limits.
In chemical and petroleum industry pipelines are one of the most important means of transportation. However, flexibility of pipeline transport systems is limited by many restrictions. Therefore, the planning of pipeline operations is a crucial part of logistics management in these industries. A particularly challenging problem is the pipeline scheduling which is concerned with finding the sequences, times, and sizes of batch injections in pipeline systems. This paper specifically studies the underlying core scheduling problem by assuming a simple multi-product pipeline system. It is shown that finding a sequence of batches which minimizes stock holding and setup costs in the long run is an NP-hard scheduling problem, namely a variant of the economic lot scheduling problem (ELSP) with additional constraints. Therefore, a powerful heuristic for the sequence-dependent ELSP is adapted and extended to meet the requirements of the outlined pipeline scheduling problem. The application of the heuristic is illustrated by case studies from chemical and petroleum industry.
Journal: European Journal of Operational Research - Volume 264, Issue 1, 1 January 2018, Pages 327-339