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 scheduling n jobs onm identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B (B < n ) jobs as a batch simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. The objective is to minimize the maximum completion time (makespan). ...

We consider an online scheduling problem in a parallel batch processing system with jobs in a batch being allowed to restart. Online means that jobs arrive over time, and all jobs’ characteristics are unknown before their arrival times. A parallel batch processing machine can handle up to several jobs simultaneously. All jobs in a batch start and complete at the same time. The processing time o...

The same kind of n jobs are processed one by one sequentially by a single machine and any number k of them may be processed as a batch. A setup time is necessary before the processing of the first job in a batch. The completion times of all the jobs in a batch are the same as the completion time of the last job in the batch and the processing time of the batch is the sum of a setup time and k t...

Batch processing machines are commonly used in wafer fabrication, kilns, and chambers used for environmental stress screening (ESS). This paper proposes two models to schedule batches of jobs on two machines in a flow shop. A set of jobs with known processing times and sizes has to be grouped, to form batches, in order to be processed on the batch processing machines. The jobs are nonidentical ...

A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time...

This paper presents a case study of an implementation of a new method for Production Leveling designed for batch production. It includes prioritizing criteria of products and level production plan. Moreover, it was applied on a subsidiary of a multinational enterprise located on Brazil, which manufacturing processes comprise batch production in a make-to-stock policy. Regarding a qualitative as...

This paper describes the use of timed Condition/Event (C/E) systems, a real-time extension of the C/E system framework introduced by Sreenivas and Krogh, for building models of chemical plants in a modular fashion and as a basis for the model-based analysis of their discrete control. The approach is illustrated by applying it to the safety control logic of a laboratory batch process.