We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. This problem 1|s-batch| P Ti is known to be NP-Hard in the ordinary sense. In this paper we show that ...

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...

{During the last decade, the problem of production scheduling has been realized to be one of the most important problems in industrial plant operations especially when multipurpose/multiproduct batch processes are involved. This paper presents a novel mathematical formulation for the short-term scheduling of batch plants. The proposed formulation is based on a continuous time representation and...

This paper addresses integrated scheduling, planning and budgeting with financial risk management in the batch chemical process industries. A cash flow and budgeting model is coupled with an advanced planning and scheduling procedure using a two-stage stochastic formulation. The results of the integrated model are compared with the results of the sequential use of scheduling followed by budgeti...

This paper reports on the development of an interactive system for opportunistic real-time dynamic production scheduling of small-batch manufacture.

Genetic algorithms have during the recent years gained popularity also in the domain of chemical engineering, among other applications for scheduling purposes. A genetic algorithm builds new sequences by combining and mutating previous sequences of genes, i.e. chromosomes, into a new set of chromosomes. In this new set, only the fittest survive, and the procedure is repeated. As a schedule in c...

In this paper, we consider the scheduling problem of minimizing total weighted completion time on uniform machines with unbounded batch. Each of the machine Ml (l = 1, ⋅ ⋅ ⋅ ,m) has a speed sl and can process up to B(≥ n) jobs simultaneously as a batch. The processing time of a batch denoted by P(B) is given by the processing time of the longest job in it, and the running time of the batch on m...

Commodity High Performance Computing (HPC) platforms such as Beowulf Clusters provide excellent opportunities to engage students with challenging projects. Courses such as parallel programming, distributed systems, operating systems, and networking can benefit from the lowcost HPC platform. In this paper we report the results on series of student projects in an advanced operating systems course...

We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem. © 1997 Elsevier Science B.V. Kevwords: Analysis of algorithms; Dynamic programming; Production/scheduling

According to the coexistence of two production style: Single Small Serial Production and Batch Production in the current Enterprise, this article analyzed the scheduling problems of this production model and studied the working flow of this production scheduling problem. Using Genetic Algorithm for the Scheduling Hybrid Production, a new system for solving the problems of Scheduling Hybrid Prod...