A simple on-line bin-packing algorithm

Items of various types arrive at a bin-packing facility according to random processes and are to be combined with other readily available items of different types and packed into bins using one of a number of possible packings. One might think of a manufacturing context in which randomly arriving subassemblies are to be combined with subassemblies from an existing inventory to assemble a variety of finished products. Packing must be done on-line; that is, as each item arrives, it must be allocated to a bin whose configuration of packing is fixed. Moreover, it is required that the packing be managed in such a way that the readily available items are consumed at predescribed rates, corresponding perhaps to optimal rates for manufacturing these items. At any moment, some number of bins will be partially full. In practice, it is important that the packing be managed so that the expected number of partially full bins remains uniformly bounded in time. We present a necessary and sufficient condition for this goal to be realized and describe an algorithm to achieve it.

Download Full-text

Autonomous Collaborative Solar Home System-Public Lighting (SHS-PL) using Bin Packing algorithm in rural Off-Grid environment

2018 Renewable Energies, Power Systems & Green Inclusive Economy (REPS-GIE) ◽

10.1109/repsgie.2018.8488837 ◽

2018 ◽

Cited By ~ 1

Author(s):

LARAKI Mehdi ◽

Aawatif HAYAR ◽

N. Benjamin Sendama

Keyword(s):

Bin Packing ◽

Grid Environment ◽

Packing Algorithm ◽

Solar Home System

Download Full-text

Expected Waste for a Bin-Packing Algorithm Using Items That are Exponentially Distributed

Operations Research ’93 ◽

10.1007/978-3-642-46955-8_51 ◽

1994 ◽

pp. 200-202

Author(s):

Walter Goessens

Keyword(s):

Bin Packing ◽

Packing Algorithm

Download Full-text

Scalable Algorithms for Server Allocation in Infostations

Handbook of Research on Scalable Computing Technologies ◽

10.4018/978-1-60566-661-7.ch027 ◽

2010 ◽

pp. 645-656

Author(s):

Alan A. Bertossi ◽

M. Cristina Pinotti ◽

Phalguni Gupta

Keyword(s):

Bin Packing ◽

Multiprocessor Scheduling ◽

Interval Graph ◽

Scalable Algorithms ◽

Coverage Area ◽

Special Cases ◽

Minimum Number ◽

Server Allocation ◽

On Line ◽

Web Surfing

The server allocation problem arises in isolated infostations, where mobile users going through the coverage area require immediate high-bit rate communications such as web surfing, file transferring, voice messaging, email and fax. Given a set of service requests, each characterized by a temporal interval and a category, an integer k, and an integer hc for each category c, the problem consists in assigning a server to each request in such a way that at most k mutually simultaneous requests are assigned to the same server at the same time, out of which at most hc are of category c, and the minimum number of servers is used. Since this problem is computationally intractable, a scalable 2-approximation online algorithm is exhibited. Generalizations of the problem are considered, which contain bin-packing, multiprocessor scheduling, and interval graph coloring as special cases, and admit scalable on-line algorithms providing constant approximations.

Download Full-text