Pages that link to "Item:Q1040981"

The following pages link to A survey of berth allocation and quay crane scheduling problems in container terminals (Q1040981):

Displaying 50 items.

• Approximate the scheduling of quay cranes with non-crossing constraints (Q1751714) (← links)
• Modeling and solving rich quay crane scheduling problems (Q1761126) (← links)
• Transshipment of containers at a container terminal: An overview (Q1869526) (← links)
• A scheduling method for Berth and Quay cranes (Q1871763) (← links)
• TOPSIS and AHP techniques for selecting the most efficient marine container yard gantry crane (Q1937856) (← links)
• Simultaneous berth allocation and yard planning at tactical level (Q1944874) (← links)
• The berth allocation problem in terminals with irregular layouts (Q1991240) (← links)
• An exact solution approach for scheduling cooperative gantry cranes (Q1991263) (← links)
• A dynamic and flexible berth allocation model with stochastic vessel arrival times (Q2005875) (← links)
• Scheduling small number of quay cranes with non-interference constraint (Q2017842) (← links)
• Solution approaches for storage loading problems with stacking constraints (Q2027013) (← links)
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
• Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays (Q2030331) (← links)
• The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects (Q2030576) (← links)
• Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
• Routing two stacking cranes with predetermined container sequences (Q2059087) (← links)
• Optimizing consolidation processes in hubs: the hub-arrival-departure problem (Q2076886) (← links)
• New formulations and solutions for the strategic berth template problem (Q2076915) (← links)
• Operations research at bulk terminal: a parallel column generation approach (Q2093922) (← links)
• Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor (Q2116934) (← links)
• Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems (Q2150520) (← links)
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey (Q2158003) (← links)
• A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals (Q2163853) (← links)
• The consecutive multiprocessor job scheduling problem (Q2178063) (← links)
• Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel (Q2184047) (← links)
• Pilotage planning in seaports (Q2189919) (← links)
• Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space (Q2197157) (← links)
• Optimal berth allocation and time-invariant quay crane assignment in container terminals (Q2256246) (← links)
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports (Q2256282) (← links)
• An exact method for scheduling a yard crane (Q2256284) (← links)
• A fast heuristic for quay crane scheduling with interference constraints (Q2268514) (← links)
• Assignment problem with conflicts (Q2273673) (← links)
• Machine scheduling with soft precedence constraints (Q2282538) (← links)
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem (Q2293760) (← links)
• Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading (Q2293995) (← links)
• Selecting algorithms for large berth allocation problems (Q2294627) (← links)
• Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles (Q2307494) (← links)
• Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas (Q2315629) (← links)
• Double girder bridge crane with double cycling: scheduling strategy and performance evaluation (Q2336415) (← links)
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results (Q2341106) (← links)
• Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards (Q2362173) (← links)
• Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports (Q2398778) (← links)
• Minimum cost noncrossing flow problem on layered networks (Q2414449) (← links)
• Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
• Novel formulations and modeling enhancements for the dynamic berth allocation problem (Q2424775) (← links)
• Integrated truck and workforce scheduling to accelerate the unloading of trucks (Q2424789) (← links)
• Berth management in container terminal: the template design problem (Q2432094) (← links)
• A queuing network model for the management of berth crane operations (Q2471220) (← links)
• Berth assignment for liner carrier clusters under a cooperative environment (Q2669590) (← links)
• Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems (Q2669757) (← links)