Robust scheduling for berth allocation and quay crane assignment problem
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+.
- An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
- Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
- MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
- Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
- New exact methods for the time-invariant berth allocation and quay crane assignment problem
- Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
- Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
- A scheduling method for Berth and Quay cranes
- A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
- A scheduling method for Berth and Quay cranes
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Hybrid metaheuristics. An emerging approach to optimization.
- Operations research at container terminals: a literature update
- Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities
- Robust berth scheduling with uncertain vessel delay and handling time
- Robust cyclic berth planning of container vessels
- The berth planning problem
- New exact methods for the time-invariant berth allocation and quay crane assignment problem
- A scheduling method for Berth and Quay cranes
- Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems
- Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
- Integrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combination
- A sample average approximation approach to the berth allocation problem with uncertain tides
- Robust optimization for the integrated berth allocation and quay crane assignment problem
- A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
- The berth allocation and quay crane assignment problem with crane travel and setup times
- Robust berth scheduling with uncertain vessel delay and handling time
This page was built for publication: Robust scheduling for berth allocation and quay crane assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1719234)
