Earticle

초록

영어

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.

목차

Abstract
 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

키워드

저자

• Yu Peng [ NUE Logistical Academy, Naval University of Engineering, Tianjin, China ]
• He Xue-jun [ NUE Logistical Academy, Naval University of Engineering, Tianjin, China ]
• Ren Ai-di [ NUE Logistical Academy, Naval University of Engineering, Tianjin, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Control and Automation

• 간기

  월간

• pISSN

  2005-4297

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605