Pages that link to "Item:Q2432094"

The following pages link to Berth management in container terminal: the template design problem (Q2432094):

Displaying 25 items.

• Tactical berth allocation under uncertainty (Q320125) (← links)
• A set-partitioning-based model for the berth allocation problem under time-dependent limitations (Q322604) (← links)
• Optimal policies for the berth allocation problem under stochastic nature (Q323540) (← links)
• Robust berth scheduling at marine container terminals via hierarchical optimization (Q336840) (← links)
• Berth allocation with time-dependent physical limitations on vessels (Q421704) (← links)
• Robust berth scheduling with uncertain vessel delay and handling time (Q763208) (← links)
• Robust cyclic berth planning of container vessels (Q989624) (← links)
• A survey of berth allocation and quay crane scheduling problems in container terminals (Q1040981) (← links)
• Real-time management of berth allocation with stochastic arrival and handling times (Q1707673) (← links)
• An integrated model for berth and yard planning in container terminals with multi-continuous berth layout (Q1730671) (← links)
• Space defragmentation for packing problems (Q1926954) (← links)
• Simultaneous berth allocation and yard planning at tactical level (Q1944874) (← links)
• A dynamic and flexible berth allocation model with stochastic vessel arrival times (Q2005875) (← links)
• New formulations and solutions for the strategic berth template problem (Q2076915) (← links)
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey (Q2158003) (← links)
• An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times (Q2239892) (← links)
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports (Q2256282) (← links)
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem (Q2293760) (← links)
• Selecting algorithms for large berth allocation problems (Q2294627) (← links)
• Operations research at container terminals: a literature update (Q2480797) (← links)
• New Lower Bound and Exact Method for the Continuous Berth Allocation Problem (Q4971379) (← links)
• Modelling a resilient yard template under storage demand fluctuations in a container terminal (Q5059222) (← links)
• Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm (Q5059243) (← links)
• An optimization approach to the scale of port cold-chain dedicated terminals considering uncertainties (Q6094572) (← links)
• Proactive berth scheduling with data-driven buffer time in container terminals (Q6495372) (← links)