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

We consider the scheduling of jobs with multiple weights on a single machine for minimizing total weighted number tardy jobs. In this setting, each job has m (or equivalently, have weighting vectors), and thus we criteria, which is to minimize under corresponding vector For model, feasibility problem aims find feasible schedule such that criterion upper bounded by its threshold value, Pareto al...

The most common way to identify success or failure of a job running in a batch-processing mode is by examining a completion code sent by the job to the host operating system. Yet, for a variety of reasons the completion code may inaccurately indicate a successful termination of the job. This article describes a different approach to monitoring the quality of batch processing jobs while in opera...

This paper compares three most common job management systems and their workings with Sun HPC ClusterTools 3.1. Various aspects such as installation, customization, scheduling and resource control issues are discussed. The three chosen systems are: Load Sharing Facility (LSF), Portable Batch System (PBS) and COmputing in DIstributed Networked Environment (CODINE)/ Global Resource Director (GRD)....