Nowadays certain actions are taken to improve the level of cleanliness in the country. People are getting more active in doing all the things possible to clean their surroundings. Various movements are also started by the government to increase cleanliness. We will try to build a system which will notify the corporations to empty the bin on time. In this system, we will put a sensor on top of t...

The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1, . . . , an in (0, 1]. Using uniform sampling, which selects a random element from the input list each time, we develop a randomized O( n)(log log n) ∑n i=1 ai +( 1 2 ) 1 2 ) time (1+2)approximation scheme for the bin packing problem. We show that every randomized algorithm with unifo...

In the bin packing problem we are given an instance consisting of a sequence of items with sizes between 0 and 1. The objective is to pack these items into the smallest possible number of bins of unit size. BestFit algorithm packs each item into the most full bin where it fits, possibly opening a new bin if the item cannot fit into any currently open bin. In early seventies it was shown that th...

In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be packed into square bins of size 1×1. 90-rotation of an item is allowed. When an item arrives, we must pack it into an active bin immediately without any knowledge of the future items. The objective is to minimize the t...

Processing Time first algorithm always finds a schedule having makespan within 43 1. Key words, bin packing, multiprocessor scheduling, approximation.Single capacity bin-packing algorithms were applied to solve this problem. Available system resources, the scheduling algorithm must be able to maintain a job working set. Bounds for multiprocessor scheduling with resource.We consider a natural ge...

In this paper we study a game problem, called bin packing game with an interest matrix, which is a generalization of all the currently known bin packing games. In this game, there are some items with positive sizes and identical bins with unit capacity as in the classical bin packing problem; additionally we are given an interest matrix with rational entries, whose element aij stands for how mu...

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 unif...

In the Bin Packing Problem with Conflicts (BPPC), we are given a set V = {1, 2, . . . , n} of items, each item i having a non-negative weight wi, and an infinite number of identical bins of weight capacity W . We are also given a conflict graph G = (V,E), where E is a set of edges such that (i, j) ∈ E when i and j are in conflict. Items in conflict cannot be assigned to the same bin. The aim of...

this article is concerned with a comparative review of jahân-nâme   by mohammad bin najib bakran and manuscripts of masâlek va mamâlek by abu al-hasan sâʽid bin ali jurjâni written by during the middle of ninth century ah. from this review it becomes clear that jorjâniʼs main source in writing his book was jahân-nâme and therefore jahân-nâme is also a good source for editing the masâlek.  howev...