Solving the Two-Dimensional Packing Problem With m-M Calculus
Aleksandar Savić, Tijana Šukilović, Vladimir Filipović (2011)
The Yugoslav Journal of Operations Research
Similarity:
Aleksandar Savić, Tijana Šukilović, Vladimir Filipović (2011)
The Yugoslav Journal of Operations Research
Similarity:
Luke Finlay, Prabhu Manyem (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced...
Georg Gati (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Khaoula Hamdi-Dhaoui, Nacima Labadie, Alice Yalaoui (2012)
RAIRO - Operations Research
Similarity:
The two-dimensional bin packing problem is a well-known problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be partially incompatible, and have to be separated by a safety distance. This complication has not yet been considered in the literature. This paper introduces this extension called the two-dimensional bin packing problem with partial conflicts (2BPPC) which is a...
Khaoula Hamdi-Dhaoui, Nacima Labadie, Alice Yalaoui (2012)
RAIRO - Operations Research
Similarity:
The two-dimensional bin packing problem is a well-known problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be partially incompatible, and have to be separated by a safety distance. This complication has not yet been considered in the literature. This paper introduces this extension called the two-dimensional bin packing problem with partial conflicts (2BPPC) which is a...
Eduardo C. Xavier, Flàvio Keidi Miyazawa (2009)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
In this paper we present a dual approximation scheme for the class constrained shelf bin packing problem. In this problem, we are given bins of capacity , and items of different classes, each item with class and size . The problem is to pack the items into bins, such that two items of different classes packed in a same bin must be in different shelves. Items in a same shelf are packed consecutively. Moreover, items in consecutive shelves must be separated by shelf divisors...
J. Katajainen, C. Levcopoulos, O. Petersson (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Hifi, Mhand, M'hallah, Rym (2009)
Advances in Operations Research
Similarity:
Bekrar, Abdelghani, Kacem, Imed (2009)
Advances in Operations Research
Similarity: