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

DOI10.1016/J.EJOR.2014.11.036MaRDI QIDQ319018zbMATH OpenOpenAlexFDO

Authors J.-C. Billaut, Andrea Grosso, F. 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

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

Recommendations

• Number of bins and maximum lateness minimization in two-dimensional bin packing
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints
• Publication:4953918
• Vector scheduling with rejection on a single machine
• A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates

Cites work

• A branch-and-bound algorithm for the two-dimensional vector packing 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
• A survey of variants and extensions of the resource-constrained project scheduling problem
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• 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
• LP models for bin packing and cutting stock problems
• Lower bounds and algorithms for the 2-dimensional vector packing problem
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
• Recent advances on two-dimensional bin packing problems
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• Resource constrained scheduling as generalized bin packing
• Scheduling algorithms
• Scheduling preparation of doses for a chemotherapy service
• Scheduling. Theory, algorithms, and systems.
• The hybrid flow shop scheduling problem

Cited in

(9)

• MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
• Order scheduling with tardiness objective: improved approximate solutions
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry
• A simple and effective algorithm for the maximum happy vertices problem
• A branch-and-price algorithm for the two-dimensional vector packing problem
• scientific article; zbMATH DE number 5494075 (Why is no real title available?)
• Single workgroup scheduling problem with variable processing personnel
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319018)