We study a class of scheduling problems, where each job is divided into a batch of unit-size tasks and these tasks can be executed in parallel on multiple servers with New-Better-than-Used (NBU) service time distributions. While many delay optimality results are available for single-server queueing systems, generalizing these results to the multi-server case has been challenging. This motivated...

Online job scheduling has demonstrated to be a key factor impacting the output performance of batch processing systems. Existing researches either proposed solutions to a single-machine processing system, or focused on minimizing the total job completion time for multiple-machine batch processing systems. Yet the study on the approaches with the objective of minimizing the job delay time on a p...

Petri nets have widely been applied in different aspect of modelling, qualitative, quantitative analysis, supervisory and coordinate control, scheduling, planning, and hybrid system design of batch processes. The paper presents an example which shows how to use Petri nets to model and analysis a realistic batch plant. The modular modelling method is adopted to model a real batch processing plan...

We analyze batch-scheduling problems that arise in connection with certain industrial applications. The models concern processing on a single max-batch machine with the additional feature that the tasks of the same batch have to be compatible. Compatibility is a symmetric binary relation—the compatible pairs are described with an undirected “compatibility graph”, which is often an interval grap...

Recently the relationship between batch struct:u-e, bottleneck machine and maximum th, oaghpi~t has been explore0 for serial, convergent and divergent process configuration~ consisting of two machines and d,.rre processes. In three of the seven possible configurations a multiple batch structure maximizes time-constrained tt-_:oughput. The O,-;qciple of scheduling a bottleneck first appears to b...