Pages that link to "Item:Q323449"

The following pages link to Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals (Q323449):

Displaying 14 items.

• New exact methods for the time-invariant berth allocation and quay crane assignment problem (Q1711448) (← links)
• Integrated berth allocation and time-variant quay crane scheduling with tidal impact in approach channel (Q1727298) (← links)
• An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports (Q1730615) (← links)
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach (Q1738835) (← links)
• Approximate the scheduling of quay cranes with non-crossing constraints (Q1751714) (← links)
• The berth allocation problem in terminals with irregular layouts (Q1991240) (← links)
• Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays (Q2030331) (← links)
• A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals (Q2163853) (← links)
• Assignment problem with conflicts (Q2273673) (← links)
• Minimum cost noncrossing flow problem on layered networks (Q2414449) (← links)
• Integrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combination (Q2691472) (← links)
• Minimum cost flow problem with conflicts (Q6065835) (← links)
• Simultaneous operation of next-generation and traditional quay cranes at container terminals (Q6112695) (← links)
• The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions (Q6113444) (← links)