Pages that link to "Item:Q319438"

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

Displaying 50 items.

• Scheduling cranes at an indented berth (Q323166) (← links)
• Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals (Q323449) (← links)
• 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)
• The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
• Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level (Q1654372) (← links)
• Sequencing dual-spreader crane operations: mathematical formulation and heuristic algorithm (Q1683073) (← links)
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem (Q1694325) (← links)
• A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations (Q1695784) (← links)
• A generalized classification scheme for crane scheduling with interference (Q1698922) (← links)
• New exact methods for the time-invariant berth allocation and quay crane assignment problem (Q1711448) (← links)
• Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels (Q1711481) (← 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)
• Exact and heuristic methods for optimizing lock-quay system in inland waterway (Q1737520) (← links)
• The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm (Q1738818) (← links)
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach (Q1738835) (← links)
• Scheduling cooperative gantry cranes with seaside and landside jobs (Q1744241) (← links)
• Approximate the scheduling of quay cranes with non-crossing constraints (Q1751714) (← links)
• A feasibility-based heuristic for the container pre-marshalling problem (Q1752173) (← links)
• The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion (Q1753475) (← links)
• The berth allocation problem in terminals with irregular layouts (Q1991240) (← links)
• An exact solution approach for scheduling cooperative gantry cranes (Q1991263) (← links)
• Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective (Q2028839) (← 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)
• 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)
• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
• Twin-crane scheduling during seaside workload peaks with a dedicated handshake area (Q2124909) (← 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)
• Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel (Q2184047) (← links)
• Constraint programming models for integrated container terminal operations (Q2189889) (← 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)
• Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports (Q2226489) (← links)
• An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times (Q2239892) (← links)
• Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions (Q2242377) (← links)
• Assignment problem with conflicts (Q2273673) (← links)
• Machine scheduling with soft precedence constraints (Q2282538) (← links)
• A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals (Q2286432) (← links)
• A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control (Q2287487) (← links)
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem (Q2293760) (← 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)
• Scheduling ships movements within a canal harbor (Q2317619) (← links)