This paper investigates a single-machine sequencing problem where the jobs are divided into families, and where a setup time is incurred whenever there is a switch from a job in one family to a job in another family. This setup only depends on the family of the job next to come and hence is sequence independent. The jobs are due-dated, and the objective is to nd a sequence of jobs that minimize...

Batch processing becomes more important in the process industries, because of the increasing product variety and the decreasing demand volumes for individual products. In batch process industries it is difficult to predict the completion time, or makespan, of a set of jobs, because jobs interact at the shop floor. In this paper, we compare two different methods for predicting the makespan of jo...

The Irix 6.5 scheduling system provides intrinsic support for batch processing, including support for guaranteed access to resources and policy-based static scheduling. Long range scheduling decisions are made by Miser, a user level daemon, which reserves the resources needed by a batch job to complete its tasks. Short-term decisions are made by the kernel in accordance with the reservations es...

We consider a single-machine scheduling problem in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem where no tardy jobs are allowed and the objective is to minimize the total compression cost, we present a strongly polynomial time algorithm. For the problem to construct the trade-off ...

In this paper, we study an integrated production an outbound delivery scheduling problem with a predefined sequence. The manufacturer has to process a set of jobs on a single machine and deliver them in batches to multiple customers. A single vehicle with limited capacity is used for the delivery. Each job has a processing time and a specific customer location. Starting from the manufacturer lo...

We consider two semi-online scheduling problems on a single batch (processing) machine with jobs’ nondecreasing processing times and jobs’ nonincreasing processing times, respectively. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultaneously. We study an unbounded model where B = ∞. The jobs that are processed together construct a batch, and a...

We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. Each machine can handle an infinite number of jobs as a batch simultaneously. The processing time of a batch is the time required for processing the longest job in the batch. Each job becomes available at its release date, which is not known in advance, and its processing time only becomes k...

This paper studies the problem of scheduling jobs in a two-machine open shop to minimize the makespan. Jobs are grouped into batches and are processed without preemption. A batch setup time on each machine is required before the rst job is processed, and when a machine switches from processing a job in some batch to a job of another batch. For this NP-hard problem, we propose a linear-time heur...

This paper considers single-machine position-dependent weights scheduling problem with past-sequence-dependent delivery times and truncated sum-of-processing-times-based learning effect. The objective is to minimize the weighted sum of due date, number early jobs tardy jobs, where are weights. Under common slack date different assignments, optimal properties given, corresponding solution algori...