Journal of Scheduling

The customer order scheduling problem has garnered considerable attention in the recent scheduling literature. It is assumed that each of several customer orders consists of several jobs, and each customer order is completed only if each job of ...

The $1|\text{s-batch}(\infty ),r_j|\sum w_j{U}_j$ scheduling problem takes as input a batch setup time $\mathrm{\Delta }$ and a set of n jobs, each having a processing time, a release date, a weight, and a due date; the task is to find a sequence of batches that minimizes the weighted ...$\mathsf{}$$\mathrm{}{}_{}{}_{}{}_{}$$\mathsf{}\mathrm{}$$$$$$$$$$\mathrm{}{}_{}{}_{}{}_{}$$\mathsf{}\mathrm{}$$\mathrm{}{}_{}{}_{}{}_{}$$$$$

This paper concerns all-to-all network routing on regular digraphs. In previous work, we focused on efficient routing in highly symmetric digraphs with low diameter for fixed degree. Here, we show that every connected regular digraph has an all-to-...

In this paper, we consider single-machine scheduling with multiple due dates per job. This is motivated by several industrial applications, where it is not important by how much we miss a due date. Instead the relevant objective is to minimize the ...$\mathrm{}{}_{}{}_{}{}_{}{}_{}$$\mathrm{}{}_{}{}_{}{}_{}{}_{}$

This paper mainly focuses on a resource leveling variant of a two-processor scheduling problem. The latter problem is to schedule a set of dependent UET jobs on two identical processors with minimum makespan. It is known to be polynomial-time ...

In this paper we deal with a complex real world scheduling problem closely related to the well-known Resource-Constrained Project Scheduling Problem (RCPSP). The problem concerns industrial test laboratories in which a large number of tests are ...