A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Theoretical Computer Science
Computers and Operations Research
Theoretical Computer Science
Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Scheduling an unbounded batch machine to minimize maximum lateness
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Bounded parallel-batch scheduling on unrelated parallel machines
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
A probabilistic task scheduling method for grid environments
Future Generation Computer Systems
An improved approximation algorithm for a class of batch scheduling problems
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
A queuing network model for minimizing the total makespan of computational grids
Computers and Electrical Engineering
Unbounded parallel batch scheduling with job delivery to minimize makespan
Operations Research Letters
On scheduling an unbounded batch machine
Operations Research Letters
| Hi-index | 0.00 |
We consider batch processing of jobs to minimize the mean response time. A batch processing machine can handle up to B jobs simultaneously. Each job is represented by an arrival time and a processing time. The processing time of a batch of several jobs is the maximum of their processing times. In batch processing, non-preemptive scheduling is usually required and we discuss this case. The batch processing problem reduces to the ordinary uni-processor system scheduling problem if B = 1. We focus on the case B = +∞. Even for this seemingly simple extreme case, we are able to show that the problem is NP-hard. We further show that several important special cases of the problem can be solved in polynomial time.