An approximate 0-1 edge-labeling algorithm for constrained bin-packing problem

Authors:
Ho Soo Lee;Mark Trumbo
Affiliations:
IBM Thomas J. Watson Research Center, Yorktown Heights, New York;IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Venue:
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Year:
1997

Citing 5
Cited 2

Artificial intelligence (2nd ed.)

Artificial intelligence (2nd ed.)
Principles of artificial intelligence

Principles of artificial intelligence
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Manufacturing Planning and Control for Supply Chain Management

Manufacturing Planning and Control for Supply Chain Management

Production design for plate products in the steel industry

IBM Journal of Research and Development - Business optimization
An application of constraint programming to generating detailed operations schedules for steel manufacturing

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a constrained bin-packing problem (CBPP) and an approximate, anytime algorithm for solutions. A CBPP is a constrained version of the bin-packing problem, in which a set of items allocated to a bin are ordered in a way to satisfy constraints defined on them and achieve near-optimality. The algorithm for CBPP uses a heuristic search for labeling edges with a binary value, together with a beam search and constraint propagation. Some experimental results are provided. This algorithm has been successfully applied to industrial-scale scheduling problems.