Pages that link to "Item:Q1738835"

The following pages link to The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach (Q1738835):

Displaying 14 items.

• A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints (Q513546) (← links)
• A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
• Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level (Q1654372) (← links)
• Approximate the scheduling of quay cranes with non-crossing constraints (Q1751714) (← links)
• The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion (Q1753475) (← links)
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
• Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals (Q2147157) (← links)
• Pilotage planning in seaports (Q2189919) (← links)
• The crane scheduling problem: models and solution approaches (Q2393470) (← links)
• Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity (Q6109309) (← 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)
• Berth and quay crane allocation and scheduling problem with renewable energy uncertainty: a robust exact decomposition (Q6164635) (← links)
• Decomposition algorithms for the robust unidirectional quay crane scheduling problems (Q6568488) (← links)