A single machine scheduling problem with two-dimensional vector packing constraints

DOI10.1016/j.ejor.2014.11.036zbMath1346.90327OpenAlexW1979373687MaRDI QIDQ319018

Andrea Grosso, Jean-Charles Billaut, Frederico Della Croce

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.11.036

zbMATH Keywords

schedulingmatheuristicsrecovering beam searchtwo-dimensional vector packing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

A simple and effective algorithm for the maximum happy vertices problem ⋮ Single workgroup scheduling problem with variable processing personnel ⋮ MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources ⋮ Order scheduling with tardiness objective: improved approximate solutions ⋮ Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem

Cites Work

• Unnamed Item
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
• Scheduling preparation of doses for a chemotherapy service
• Recent advances on two-dimensional bin packing problems
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Resource constrained scheduling as generalized bin packing
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• LP models for bin packing and cutting stock problems
• The hybrid flow shop scheduling problem
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
• Scheduling
• Lower bounds and algorithms for the 2-dimensional vector packing problem

This page was built for publication: A single machine scheduling problem with two-dimensional vector packing constraints