A PTAS for parallel batch scheduling with rejection and dynamic job arrivals

Authors:
Zhigang Cao;Xiaoguang Yang
Affiliations:
Key Laboratory of Management, Decision & Information Systems, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, PR China;Key Laboratory of Management, Decision & Information Systems, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, PR China
Venue:
Theoretical Computer Science
Year:
2009

Citing 11
Cited 7

Multiprocessor Scheduling with Rejection

SIAM Journal on Discrete Mathematics
On-line uniform machine scheduling with rejection

Computing
Preemptive multiprocessor scheduling with rejection

Theoretical Computer Science
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Minimizing Makespan in Batch Machine Scheduling

Algorithmica
Note: minimizing makespan with release times on identical parallel batching machines

Discrete Applied Mathematics
On several scheduling problems with rejection or discretely compressible processing times

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A PTAS for scheduling on agreeable unrelated parallel batch processing machines with dynamic job arrivals

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Minimizing makespan on a single batching machine with release times and non-identical job sizes

Operations Research Letters
Efficient scheduling algorithms for a single batch processing machine

Operations Research Letters
On-line scheduling of unit time jobs with rejection: minimizing the total completion time

Operations Research Letters

Bounded parallel-batch scheduling on unrelated parallel machines

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Lorenz versus Pareto dominance in a single machine scheduling problem with rejection

EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Two-machine flow-shop scheduling with rejection

Computers and Operations Research
A bicriteria approach to scheduling a single machine with job rejection and positional penalties

Journal of Combinatorial Optimization
Scheduling on parallel identical machines with job-rejection and position-dependent processing times

Information Processing Letters
Single Machine Scheduling with Rejection: Minimizing Total Weighted Completion Time and Rejection Cost

International Journal of Applied Evolutionary Computation
A survey on offline scheduling with rejection

Journal of Scheduling

Quantified Score

Hi-index	5.24

Visualization

Abstract

In the parallel batch scheduling model, a group of jobs can be scheduled together as a batch while the processing time of this batch is the greatest processing time among its members; in the model of scheduling with rejection, any job can be rejected with a corresponding penalty cost added to the objective value. In this paper, we present a PTAS for the combined model of the above two scheduling models where jobs arrive dynamically. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of the rejected ones. Our basic approaches are dynamic programming and roundings.