2021
DOI: 10.1016/j.tre.2021.102449
|View full text |Cite
|
Sign up to set email alerts
|

Berth and quay crane allocation and scheduling with worker performance variability and yard truck deployment in container terminals

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(5 citation statements)
references
References 29 publications
0
5
0
Order By: Relevance
“…Li et al [16] investigated an integrated berth allocation and quay crane assignment with uncertain quay crane maintenance activities and established a stochastic integer linear programming model to minimize the excepted total turnaround time of vessels. Chargui et al [17] proposed a new extension of the berth and quay crane allocation and scheduling problems considering worker performance variability and yard truck deployment constraints. Ji et al [18] solved the Berth Allocation and Quay Crane Assignment Problem (BACAP) with stochastic vessel arrival times using a scenario generation method and an MILP model to minimize the expected total vessel stay time.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Li et al [16] investigated an integrated berth allocation and quay crane assignment with uncertain quay crane maintenance activities and established a stochastic integer linear programming model to minimize the excepted total turnaround time of vessels. Chargui et al [17] proposed a new extension of the berth and quay crane allocation and scheduling problems considering worker performance variability and yard truck deployment constraints. Ji et al [18] solved the Berth Allocation and Quay Crane Assignment Problem (BACAP) with stochastic vessel arrival times using a scenario generation method and an MILP model to minimize the expected total vessel stay time.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Firstly, Equation ( 16) specifies a minimum and maximum number of quay cranes that can be assigned to each vessel. At the same time, (17) ensures the quay cranes serving a vessel belong to the terminal where the vessel berths. In addition, as shown in ( 18) and ( 19), each quay crane serves at most one vessel at the same time; (20) indicates that the serial number of quay cranes serving one vessel must be consecutive.…”
Section: Constraintsmentioning
confidence: 99%
“…[12] investigated the integration of BAP, quay crane assignment problem, and yard allocation problem. In [13], they also studied an integrated problem that combined BAP with the quay crane allocation and scheduling problems. In practice, it is generally impossible for all the parameters to be fixed and known in advance.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Although conflict-free constraint ( Hu et al, 2022 ) or deadlock detection method ( Wu et al, 2022 ) are considered, conflict and deadlock are still resolved at route level while vehicle maneuver and node-arc map are not captured. The studies on CTs pay more attention on planning level, such as truck dispatching/deployment ( Chargui et al, 2021 ) and truck appointment system for arrival scheduling (will be discussed in later section).…”
Section: Trends In Emerging Technology and Management Researchmentioning
confidence: 99%