Algorithms for packing and scheduling problems. (Abstract of thesis)

DOI10.1007/s10288-002-0011-1zbMath1041.90529OpenAlexW1974410288MaRDI QIDQ1429294

Michele Monaci

Publication date: 18 May 2004

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-002-0011-1

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem, A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems, Accelerating column generation for variable sized bin-packing problems, A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint, Efficient algorithms for the offline variable sized bin-packing problem, Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Mixed-integer linear programming heuristics for the prepack optimization problem, A generalized bin packing problem for parcel delivery in last-mile logistics, Relaxations and exact solution of the variable sized bin packing problem, Variable neighbourhood search for the variable sized bin packing problem, Lower bounds for three-dimensional multiple-bin-size bin packing problems, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces, An exact algorithm for the type-constrained and variable sized bin packing problem, Solving bin packing problems using VRPSolver models, Heuristics for the variable sized bin-packing problem, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, The two-dimensional bin packing problem with variable bin sizes and costs