Pages that link to "Item:Q742501"

The following pages link to A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules (Q742501):

Displaying 8 items.

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals (Q319438) (← links)
• A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints (Q513546) (← links)
• Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level (Q1654372) (← links)
• A generalized classification scheme for crane scheduling with interference (Q1698922) (← links)
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach (Q1738835) (← links)
• Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
• Modelling and metaheuristic for gantry crane scheduling and storage space allocation problem in railway container terminals (Q1784912) (← links)
• Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model (Q6187236) (← links)