this comprehensive work explores the research performed inoptimization of the collection bin and in recycle bin location-allocation issues in solidwaste management. although the collection phase of solid waste management accountsfor a significant proportion of the municipal budget, it has attracted only limitedattention of the researchers. optimization of the collection bin and recycle bin loca...

We suggest a method for minimizing the paging on a system with a very heavy memory usage. Sometimes there are processes with active memory allocations that need to be in the physical memory, and their total size exceeds the physical memory size. In these cases the operating system will start swapping pages in and out of the memory on every context switch. We minimize this thrashing by splitting...

Links [1] http://directory.ucdavis.edu/cgi-bin/directory_results.shtml?filter=alan+ekstrand [2] http://directory.ucdavis.edu/cgi-bin/directory_results.shtml?filter=jessica+davis [3] http://directory.ucdavis.edu/cgi-bin/directory_results.shtml?filter=nicoel+dias [4] http://directory.ucdavis.edu/cgi-bin/directory_results.shtml?filter=sherri+goss [5] http://directory.ucdavis.edu/cgi-bin/directory_...

Nowadays, the increase in consumption and shortening of life cycle products significantly amount waste generated, causing serious environmental problems. As a result, management has become one most important tasks 21st century, which puts huge burden on economy. Waste means practical implementation protection environment from harmful effects entire waste. This is process that involves preventio...

We consider a variant of the classical Bin Packing Problem, called Fully Dynamic Bin Packing. In this variant, items of a size in (0,1] must be packed in bins of unit size. In each time step, an item either arrives or departs from the packing. An algorithm for this problem must maintain a feasible packing while only repacking a bounded number of items in each time step. We develop an algorithm ...

In this paper, we consider the variable sized bin packing problem where the objective is to minimize the total cost of used bins when the cost of unit size of each bin does not increase as the bin size increases. Two greedy algorithms are described, and analyzed in three special cases: (a) the sizes of items and bins are divisible, respectively, (b) only the sizes of bins are divisible, and (c)...

The bin packing problem can be best described in 'transportation' terms: given a set of boxes of different sizes, how should one pack them all into containers of a given size, in order to use as few containers as possible? The task of balancing of (robotized) assembly lines is of considerable industrial importance. It consists of assigning operations from a given set to workstations in a produc...