We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is required to be on-line (e. g. if we open an...

In this paper we consider flow shop scheduling problems with a time-dependent learning effect. The time-dependent learning effect of a job on a machine is assumed to be a function of the total normal processing time of the jobs scheduled in front of the job on the machine. The objective is to...

This paper considers a two-stage flexible flow shop scheduling problem with task tail group constraint, where the two stages are made up of unrelated parallel machines. The objective is to find a schedule to minimize the total tardiness of jobs. For this problem, a mathematical model is...

No abstract available.

We consider the problem in which several products have to be shipped from a supplier to a set of retailers over an infinite time horizon. Each product is made available at the supplier and absorbed by each retailer at given constant production and consumption rates. For each product, the unit...

Given a set of rectangular pieces to be cut from an unlimited number of standardized stock pieces (bins), the Two-Dimensional Finite Bin Packing Problem is to determine the minimum number of stock pieces that provide all the pieces. The problem is NP-hard in the strong sense and finds many...