The study of balls-into-bins processes or occupancy problems has a long history. These processes can be used to translate realistic problems into mathematical ones in a natural way. In general, the goal of a balls-into-bins process is to allocate a set of independent objects (tasks, jobs, balls) to a set of resources (servers, bins, urns) and, thereby, to minimize the maximum load. In this pape...

The study of balls-into-bins games or occupancy problems has a long history since these processes can be used to translate realistic problems into mathematical ones in a natural way. In general, the goal of a balls-into-bins game is to allocate a set of independent objects (tasks, jobs, balls) to a set of resources (servers, bins, urns) and, thereby, to minimize the maximum load. In this paper ...

What affects people’s behavior when they dispose items? The distance hypothesis predicts that the number of misplaced items is a function of the distance of an appropriate bin. We categorized and mapped bins at 140 locations on the campus of a major research university in the Midwest and calculated the distances between adjacent bins. The distance hypothesis predicts that users dispose more rec...

objectives: monitoring development in infancy results in early detection of developmental delay, and early intervention can prevent sever complications of developmental disorders. the purpose of this study was to determine quality of developmental screening of 3-12 months infants referred to tehran health centers, through comparing with screening by bayley infant neurodevelopmental screener ii ...

We study the following multi-objective combinatorial stack-up problem from delivery industry. Given a sequence q of labeled bins and two positive integers s and p. The aim is to stack-up the bins by iteratively removing one of the rst s bins of the sequence and put it to one of the p stack-up places. Each of these places has to contain bins of only one label, bins of di erent labels have to be ...

We study the combinatorial FIFO stack-up problem. In delivery industry, bins have to be stacked-up from conveyor belts onto pallets. Given k sequences q1, . . . ,qk of labeled bins and a positive integer p, the goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of p stack-up places. Each of these pallets has to co...