A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis

Guan, Yongpei; Xiao, Wenqiang; Cheung, Raymond K.; Li, Chung‐Lun

doi:10.1016/s0167-6377(02)00147-5

Cited by 119 publications

(47 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The static continuous BAP has been considered by Li et al (1998), Guan et al (2002) and Park and Kim (2003). Guan and Cheung (2004) consider continuous dynamic BAP with fixed handling times using a tree search procedure to minimize the total weighted port stay time of vessels.…”

Section: Literature Reviewmentioning

confidence: 99%

Exact and heuristic methods to solve the berth allocation problem in bulk ports

Umang

Bierlaire

Vacca

2013

Transportation Research Part E: Logistics and Transportation Re

114

View full text Add to dashboard Cite

The Berth Allocation Problem (BAP) is one of the most critical and widely studied problems in port operations. While significant contributions have been made in the use of operations research methods and techniques to solve the BAP in container terminals, almost no attention has been directed to bulk ports. In this paper, we study the berth allocation problem in bulk ports for hybrid berth layout and dynamic vessel arrivals. A key difference that distinguishes the berth allocation problem in bulk ports from that in container terminals is that it is necessary to account for the cargo type on the vessel. In our model, the cargo locations on the yard and the locations of the fixed facilities such as conveyors and pipelines along the quay are explicitly taken into consideration in modeling the handling times of the vessels berthing at the port. The objective of the allocation is to minimize the total service time of all vessels berthing at the port in a given planning horizon. For a given yard layout of the bulk terminal and given locations of fixed facilities such as conveyors and pipelines along the quay, our model enhances coordination between berthing and yard activities. We present a mixed integer linear programming (MILP) approach to model the problem, and an alternate exact solution approach based on generalized set partitioning. A heuristic approach based on the principle of squeaky wheel optimization is also presented. We compare the formulations from a computational perspective through extensive numerical experiments based on instances inspired from real data obtained from SAQR port, Ras Al Khaimah, UAE, the biggest bulk port in the middle east. Our research problem derives from the realistic requirements of the port where currently the waiting times for the vessels are very large. The results indicate that the set partitioning approach and the heuristic approach can be used to obtain near-optimal solutions for even larger problem size.2

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Exact and heuristic methods to solve the berth allocation problem in bulk ports

Umang

Bierlaire

Vacca

2013

Transportation Research Part E: Logistics and Transportation Re

114

View full text Add to dashboard Cite

show abstract

“…They used hierarchical optimization framework, using hierarchical structure that distinguishes between two contradictory objectives port managers come across for the berth allocation problem. Guan et al (2002) assigned weights to the vessels according to their sizes which were used within the objective function where the aim was to minimize the total weighted completion time of vessel service. Guan and Cheung (2004) defined a weight coefficient for each vessel and they optimized the total weighted flow time using a method that combines tree procedure and a heuristic.…”

Section: Literature Reviewmentioning

confidence: 99%

Priority control of berth allocation problem in container terminals

Ursavas

2015

Ann Oper Res

View full text Add to dashboard Cite

This paper presents a decision support system for the core problem of berth allocation decision in a container terminal. The allocation of berths to the calling vessels is complex with the fact that different service level requirements are required for different vessels. Terminal managers demand for effective decision support systems that would aid them with the allocation problem considering service priorities. Consequently, this study provides a DSS, built by a dynamic discrete-event simulation model embedded with an optimization tool that determines the priority controls for the berth allocation to the calling vessels. To show the practical application of the DSS, a comprehensive case study from a Turkish container terminal considering the current state and future expansion plans that also provides an indication of the usability aspect of the program on other ports around the world has been conducted. Further experiments are conducted based on data from the Port of Rotterdam. The DSS presented in this study may help port authorities in determining more efficient allocation decisions within a container terminal.

show abstract

“…Some researches focus on average completion time of all jobs [3,8]. Some researchers focus on total completion time [3,7]. However, most of the research [1,4,6,10] focus on the makespan -the completion time of the last job.…”

Section: Related Workmentioning

confidence: 99%