In this paper, we present new approximation results for the offline problem of single machine scheduling with sequenceindependent set-ups and item availability, where the jobs to be scheduled are independent (i.e., have no precedence constraints) and have a common release time. We present polynomial-time approximation algorithms for two versions of this problem. In the first version, the input ...

We study a class of scheduling problems involving the maximum lateness criterion and an element of batching For all the problems that we examine algorithms appear in the literature which consist of a sorting step to determine an optimal job sequence followed by a dynamic programming step which determines the optimal batches In each case the dynamic program is based on a backward recursion of wh...

Problems with unit execution time (UET) tasks and two identical parallel processors have received a great deal of attention in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a situation when a task may require both processors simultaneously. Following Lloyd, we term such task systems systems with concurrency. For problems with...

Blazewicz, J., W. Kubiak and S. Martello, Algorithms for minimizing maximum lateness with unit length tasks and resource constraints, Discrete Applied Mathematics 42 (1993) 1233138. The problem we consider is that of scheduling n unit length tasks on identical processors in the presence of additional scarce resources. The objective is to minimize maximum lateness. It has been known for some tim...