Robust scheduling for berth allocation and quay crane assignment problem
type: Item
instance of: scholarly article
title: Robust scheduling for berth allocation and quay crane assignment problem
zbMATH Open document ID: 1407.90173
DOI: 10.1155/2014/834927
author: M. Rodriguez-Molins
author: Miguel A. Salido
author: Federico Barber
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for scheduling problems without any previous knowledge about incidences. This paper is based on proportionally distributing operational buffers among the tasks. In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems. The dynamism and uncertainty are managed by assessing the robustness of the schedules. The robustness is introduced by means of operational buffer times to absorb those unknown incidences or breakdowns. Therefore, this problem becomes a multiobjective combinatorial optimization problem that aims to minimize the total service time, to maximize the buffer times, and to minimize the standard deviation of the buffer times. To this end, a mathematical model and a new hybrid multiobjective metaheuristic is presented and compared with two well-known multiobjective genetic algorithms: NSGAII and SPEA2+.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7017389
describes a project that uses: SPEA2
MaRDI profile type: Publication
Wikidata QID: Q59069817
full work available at URL: https://doi.org/10.1155/2014/834927
OpenAlex ID: W2114653571
cites work: Operations research at container terminals: a literature update
cites work: The berth planning problem
cites work: A survey of berth allocation and quay crane scheduling problems in container terminals
cites work: A scheduling method for Berth and Quay cranes
cites work: Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities
cites work: Robust cyclic berth planning of container vessels
cites work: A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
cites work: Robust berth scheduling with uncertain vessel delay and handling time
cites work: Hybrid metaheuristics. An emerging approach to optimization.
Recommended article: An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
Recommended article: Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
Recommended article: MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
Recommended article: Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
Recommended article: New exact methods for the time-invariant berth allocation and quay crane assignment problem
Recommended article: Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Recommended article: Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
Recommended article: A scheduling method for Berth and Quay cranes
description: scientific article; zbMATH DE number 7017389