In this paper we introduce vFlow A framework for rapid designing of batch processing applications for Cloud Computing environment. vFlow batch processing system extracts tasks from the vPlans diagrams, systematically captures the dynamics in batch application management tasks, and translates them to Cloud environment API, named vDocuments, that can be used to execute batch processing applicatio...

This paper investigates the scheduling problem of minimizing makespan on parallel batch processing machines encountered in different manufacturing environments, such as the burn-in operation in the manufacture of semiconductors and the aging test operation in the manufacture of thin film transistor-liquid crystal displays (TFT-LCDs). Each job is characterized by a processing time, a release tim...

The present study deals with the batch and fed-batch mass production of Steinernema carpocapsae. S. carpocapsae is an entomoparasitic nematode that is used as a biological control agent of soil-borne crop insect pests. The ability and efficiency of fed-batch culture process was successful through the utilization of the nematode’s bacterial symbiont Xenorhabdus nematophila. Results from the fed-...

This paper investigates the scheduling problem of parallel identical batch processing machines in which each machine can process a group of jobs simultaneously as a batch. Each job is characterized by its size and processing time. The processing time of a batch is given by the longest processing time among all jobs in the batch. Based on developing heuristic approaches, we proposed a hybrid gen...

This paper focuses on production scheduling in a semiconductor wafer fab producing multiple product types that have different due dates and different process flows. In the wafer fab, wafer lots are processed on serial and batch processing workstations, each of which consists of parallel identical machines. Machines in serial processing workstations process wafer lots one by one, while those in ...

A batch machine is a machine that can process up to c jobs simultaneously as a batch, and the processing time of the batch is equal to the longest processing time of the jobs assigned to it. In this paper, we deal with the complexity of scheduling an unbounded batch machine, i.e., c = +∞. We prove that minimizing total tardiness is binary NP-hard, which has been an open problem in the literatur...