Queue-constrained packing: a vehicle ferry case study
type: Item
instance of: scholarly article
title: Queue-constrained packing: a vehicle ferry case study
zbMATH Open document ID: 1487.90540
author: Christopher Bayliss
author: Christine S. M. Currie
author: Julia A. Bennell
author: Antonio Martínez-Sykora
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 7354351
zbMATH Keywords: packing
zbMATH Keywords: logistics
zbMATH Keywords: stochastic optimization
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.07.027
OpenAlex ID: W3042953019
cites work: A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity
cites work: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
cites work: Algorithms for Scheduling Runway Operations Under Constrained Position Shifting
cites work: Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Bounds for Two-Dimensional Cutting
cites work: An exact method for the 2D guillotine strip packing problem
cites work: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
cites work: LP models for bin packing and cutting stock problems
cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
cites work: Higher‐Dimensional Packing with Order Constraints
cites work: A general framework for bounds for higher-dimensional orthogonal packing problems.
cites work: Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
cites work: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
cites work: A review of the application of meta-heuristic algorithms to 2D strip packing problems
cites work: Algorithms for the variable sized bin packing problem
cites work: New lower bounds for bin packing problems with conflicts
cites work: Optimization by Simulated Annealing
cites work: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
cites work: The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
cites work: Two-dimensional packing problems: a survey
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
cites work: Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
cites work: The Dynamic and Stochastic Knapsack Problem with Deadlines
cites work: The two-dimensional bin packing problem with variable bin sizes and costs
cites work: Two dimensional knapsack with unloading constraints
cites work: The theory and practice of revenue management
cites work: An improved typology of cutting and packing problems
cites work: A skyline heuristic for the 2D rectangular packing and strip packing problems
cites work: A new upper bound for unconstrained two-dimensional cutting and packing
cites work: New upper bounds for online strip packing
DOI: 10.1016/J.EJOR.2020.07.027
description: scientific article; zbMATH DE number 7354351