In this paper we consider a simplified version of the stock cutting (two-dimensional bin packing) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) when applied to this problem. The results show that tabu search and simulated annealing produce good quality results. This is not the case with the genetic algorithm. The prob...

ii

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

Bin covering takes as input a list of item sizes and places them into bins of unit demand so as to maximize the number of bins whose demand is satissed. This is in a sense a dual problem to the classical one-dimensional bin packing problem, but has for many years lagged behind the latter as far as the quality of the best approximation algorithms. We design algorithms for this problem that close...

In this article we describe a practical planning problem, the potted plant packing problem, and our first approaches to solve this problem. The transportation of plants is comparably expensive as they require careful treatment due to there sensitivity. For standardised transport, potted plants are loaded on transport trollies. The cost of transportation depends on the number of these trollies. ...

In the bin packing problem, we get a sequence of packets of size r 1 ; r 2 ; r 3 ; : : :, each r i 1, and we must place the packets into bins of size 1 using as few bins as possible. The size of a bin is the accumulated size of all packets in the bin, and the free capacity of a bin is 1 minus its size.

Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a two-level tabu search for this problem. The first level aims to reduce the number of bins. The second optimizes the packing of the bins. This latter procedure is based on the Interval Graph representati...

Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a two-level tabu search for this problem. The first level aims to reduce the number of bins. The second optimizes the packing of the bins. This latter procedure is based on the Interval Graph representati...

Initially I was concerned with offline two-dimensional bin packing with one-dimensional vehicle routing. The problem is defined by a set of items, each having a height, a width and a destination distance within (0,1]. The destinations are aligned on the same road, along with the depot (starting point) on one side. The goal is to pack items into vehicles of 1 × 1 loading space, drive the vehicle...

We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a size si ∈ [0, 1] and a color ci ∈ C, where C is a set of colors (that is not necessarily known in advance). The total size of items packed into a bin cannot exceed its size, thus an item i can always be packed into a ...