원문정보
초록
영어
The alongside replenishment scheduling problem with time constraint determining the partition of the ships, the order of replenishment and the allocation of time to the ships at the same time is analyzed. It is equivalent to a multi-stage flow shop scheduling problem with the object of maximizing the effectiveness value of ship fleet. The problem solving process is divided into three steps, and based on the analysis of the three steps, a heuristic algorithm is proposed. The algorithm firstly considers the time allocated to each ship, and then sequences the ships by heuristic rule combining greed with insertion, finally determines the ships partitioning to the port and standard side. Emulating example with different problems’ scale and time constraints shows that the proposed heuristic algorithm is superior to some other algorithms.
목차
1. Introduction
2. Analysis of the Alongside Replenishment Scheduling Problem
2.1. Description of the Problem
2.2 Analysis of the Problem
3. Algorithm Steps
3.1 Description of Algorithm
3.2 Detailed Algorithm Steps
4. Example Analysis
4.1 Data Design
4.2 Results and Analysis
5. Conclusion
References