New heuristics for one-dimensional bin-packing

Computers and Operations Research

Volumn 29, Issue 7, 2002, Pages 821-839

  Fleszar, Krzysztof ^a   Hindi, Khalil S ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Bin packing; Heuristics; Variable neighbourhood search

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; HEURISTIC METHODS; POLYNOMIALS;

MINIMAL BIN SLACK (MBS);

PROBLEM SOLVING;

ALGORITHM;

ALGORITHM; BIN PACKING; HEURISTIC; MATHEMATICAL ANALYSIS; METHODOLOGY; PROCESSING; QUALITY CONTROL;

EID: 0036604755     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00082-4     Document Type: Article

References (11)

1. BISON: A fast hybrid procedure for exactly solving the one-dimentional bin packing problem
2. Exact solution of bin-packing problems using column generation and branch-and-bound
3. A new heuristic algorithm for the one-dimentional bin-packing problem
4. New classes of lower bounds for bin packing problems
5. Assembly line balancing with a precedence matrix
6. Heuristic alogrithms for the resource-constrained project scheduling problem: Classification and computational analysis
7. An introduction to variable neighbourhood search
8. Variable neighbourhood search
9. OR-library: Distributing test problem by electronic mail