A branch-and-price algorithm for the temporal bin packing problem
We study an extension of the classical Bin Packing Problem, where each item consumes the
bin capacity during a given time window that depends on the item itself. The problem asks …
bin capacity during a given time window that depends on the item itself. The problem asks …
A branch-and-price algorithm for the two-dimensional vector packing problem
The two-dimensional vector packing problem is a well-known generalization of the classical
bin packing problem. It considers two attributes for each item and bin. Two capacity …
bin packing problem. It considers two attributes for each item and bin. Two capacity …
Dual inequalities for stabilized column generation revisited
T Gschwind, S Irnich - INFORMS Journal on Computing, 2016 - pubsonline.informs.org
Column generation (CG) models have several advantages over compact formulations: they
provide better linear program bounds, may eliminate symmetry, and can hide nonlinearities …
provide better linear program bounds, may eliminate symmetry, and can hide nonlinearities …
Stabilized branch-and-price algorithms for vector packing problems
This paper considers packing and cutting problems in which a packing/cutting pattern is
constrained independently in two or more dimensions. Examples are restrictions with …
constrained independently in two or more dimensions. Examples are restrictions with …
An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
The volumetric weight of a package has become an essential factor in calculating the
delivery cost of shipments in the international logistics market. In this work, we extend the …
delivery cost of shipments in the international logistics market. In this work, we extend the …
[HTML][HTML] Classification and evaluation of the algorithms for vector bin packing
Abstract Heuristics for Vector Bin Packing (VBP) play an important role in modern distributed
computing systems and other applications aimed at optimizing the usage of …
computing systems and other applications aimed at optimizing the usage of …
Product sequencing in multiple-piece-flow assembly lines
A Otto, X Li - Omega, 2020 - Elsevier
Modern markets demand mass customization, that is, the manufacture of customized
products at low cost. Mass customization represents a major challenge for the organization …
products at low cost. Mass customization represents a major challenge for the organization …
A single machine scheduling problem with two-dimensional vector packing constraints
JC Billaut, F Della Croce, A Grosso - European Journal of Operational …, 2015 - Elsevier
We consider a scheduling problem where jobs consume a perishable resource stored in
vials. It leads to a new scheduling problem, with two-dimensional jobs, one dimension for …
vials. It leads to a new scheduling problem, with two-dimensional jobs, one dimension for …
Simple but effective heuristics for the 2-constraint bin packing problem
The 2-constraint bin packing problem consists in packing a given number of items, each one
characterised by two different but not related dimensions, into the minimum number of bins …
characterised by two different but not related dimensions, into the minimum number of bins …
[图书][B] Dual-Feasible Functions for Integer Programming and Combinatorial Optimization
The concept of dual-feasible function (DFF) has been used to improve the resolution of
several combinatorial optimization problems involving knapsack inequalities like cutting and …
several combinatorial optimization problems involving knapsack inequalities like cutting and …