This paper deals with scheduling for single machine batch processing, specifically the transporting problem with one vehicle. Capacity restrictions of 406 T.T. Dang, B. Frankovič, I. Budinská, B. Flood, C. Sheahan, B. L. Dang the machine are considered and the main objective is to find an assignment of jobs to achieve the minimal processing time of all batches, given these capacities. A polynom...

This paper considers a scheduling problem for a single burn-in oven in the semiconductor manufacturing industry where the oven is a batch processing machine and each batch processing time is represented by the largest processing time among those of all the jobs contained in the batch. Each job belongs to one of the given number of families.Moreover, the release times of the jobs are di!erent fr...

This research addresses a batch scheduling model for a single machine processing parts of a single item to minimize total actual flow time, defined as interval time from the arrival time to the due date. The part processing time is assumed to be increasing linearly with increasing the waiting time of the part from the batch completion time to its due date. The model consists of the following de...

In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial algorithms for various combinations of the primary and secondary criteria. This is the Pre-Published Version.

This paper considers a scheduling problem for minimizing the sum of the absolute deviations of completion times from the due dates of all jobs (earliness-tardiness) on a single batch processing machine. For this problem, each job has a corresponding processing time and size and all jobs have the common due date. The problem under study is NP-hard and hence a hybrid genetic algorithm based on a ...

For extended periods of time, sequence generation models rely on beam search as the decoding algorithm. However, the performance of beam search degrades when the model is over-confident about a suboptimal prediction. In this work, we enhance beam search by performing minimum Bayes-risk (MBR) decoding for some extra steps at a later stage. In our experiments, we found that the conventional MBR r...

SVMs suffer from the problem of large memory requirement and CPU time when trained in batch mode on large data sets. We overcome these limitations, and at the same time make SVMs suitable for learning with data streams, by constructing incremental learning algorithms. We first introduce and compare different incremental learning techniques, and show that they are capable of producing performanc...

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...