Approximation algorithms for the oriented two-dimensional bin packing problem

Article Abstract:

The Oriented Two-Dimensional Bin Packing problem (2D-BPP), given a set of rectangular items that are each characterized by a height hj and weight wj where j = 1,....,n and a limitless amount of identical rectangular bins which each have a height H and width W, is to pack each item into a bin so that no two items overlap and the number of required bins is reduced. The problem is known to be strongly NP-hard and has many practical applications. A tabu search approach is used to derive an approximation algorithm for the 2D-BPP.

Research, Models, Mathematical models, Algorithms, Cutting, Packing for shipment, Packing (Shipments), Numerical calculations

---

Lower bounds and heuristic algorithms for the ki-partitioning problem

Article Abstract:

Solution to the problem of dividing a set of positive integers into subsets is derived, using lower bound and heuristic algorithms.

United States, Tests, problems and exercises, Usage, Heuristic, Branch and bound algorithms, Heuristics (Psychology), Numbers, Natural, Natural numbers

---

A note on exact algorithms for the identical parallel machine scheduling problem

Article Abstract:

The evaluation of the performance of an exact algorithm solution for the parallel machine scheduling problem is discussed.

Italy, Evaluation, Scheduling (Management), Parallel processing

Similar abstracts:

• Abstracts: A recursive exact algorithm for weighted two-dimensional cutting. Computational issues in a stochastic finite horizon one product recovery inventory model
• Abstracts: A linear approximation model for the parameter design problem. Heuristic methods for gang-rip saw arbor designs
• Abstracts: Network simplex algorithm for the general equal flow problem. New variants of the criss-cross method for linearly constrained convex quadratic programming
• Abstracts: An optimal polynomial time algorithm for the common cycle economic lot and delivery-scheduling problem. Optimal pricing and quantity of products with two offerings
• Abstracts: Stronger K-tree relaxations for the vehicle routing problem. A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.