SCHEDULING ALGORITHMS FOR MOBILE HARBOR: AN EXTENDED M-PARALLEL MACHINE PROBLEM

Authors

  • Inkyung Sung Korea Advanced Institute of Science and Technology
  • Hochang Nam Korea Advanced Institute of Science and Technology
  • Taesik Lee Korea Advanced Institute of Science and Technology

DOI:

https://doi.org/10.23055/ijietap.2013.20.1-2.507

Abstract

Mobile Harbor is a ship, or a movable floating structure with container loading/unloading equipment on board, so that it can work with a container ship anchored in sea. In some sense, a Mobile Harbor is equivalent to a berth with a quay crane of a conventional port. For a Mobile Harbor-based system to handle a large volume of containers, multiple units of Mobile Harbor are required. As such, operation schedule for the units is essential to the productivity of the system. In this paper, a method to compute a scheduling solution for Mobile Harbor is proposed. It determines the operation and time sequence of jobs by the units to minimize the makespan of container handling operation. This problem is formulated with Mixed Integer Programming (MIP), based on an m-parallel machine problem. In addition, a heuristic approach using a Genetic Algorithm is developed to obtain a near optimal solution with reduced computation time.

Published

2013-04-08

How to Cite

Sung, I., Nam, H., & Lee, T. (2013). SCHEDULING ALGORITHMS FOR MOBILE HARBOR: AN EXTENDED M-PARALLEL MACHINE PROBLEM. International Journal of Industrial Engineering: Theory, Applications and Practice, 20(1-2). https://doi.org/10.23055/ijietap.2013.20.1-2.507

Issue

Section

Logistics and Material Handling