Pages that link to "Item:Q5298341"

The following pages link to Some complexity results and an efficient algorithm for quay crane scheduling problem (Q5298341):

Displaying 7 items.

• A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules (Q742501) (← links)
• Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse (Q1683060) (← links)
• The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion (Q1753475) (← links)
• A scheduling method for Berth and Quay cranes (Q1871763) (← links)
• Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles (Q2307494) (← links)
• A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129) (← links)
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal (Q3423263) (← links)