Note: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Authors:
Lingfa Lu;Liqi Zhang;Jinjiang Yuan
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China
Venue:
Theoretical Computer Science
Year:
2008

Citing 7
Cited 10

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Multiprocessor Scheduling with Rejection

SIAM Journal on Discrete Mathematics
Preemptive multiprocessor scheduling with rejection

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing mean response time in batch processing system

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On-line scheduling of unit time jobs with rejection: minimizing the total completion time

Operations Research Letters
On scheduling an unbounded batch machine

Operations Research Letters

Bounded single-machine parallel-batch scheduling with release dates and rejection

Computers and Operations Research
Minimizing the makespan on a single parallel batching machine

Theoretical Computer Science
Single-machine scheduling under the job rejection constraint

Theoretical Computer Science
Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment

Computers and Operations Research
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
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
Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we consider the unbounded parallel batch machine scheduling with release dates and rejection. A job is either rejected with a certain penalty having to be paid, or accepted and processed in batches on the parallel batch machine. The processing time of a batch is defined as the longest processing time of the jobs contained in it. The objective is to minimize the sum of the makespan of the accepted jobs and the total rejection penalty of the rejected jobs. We show that this problem is binary NP-hard and provide a pseudo-polynomial-time algorithm. When the jobs have the same rejection penalty, the problem can be solved in polynomial time. Finally, a 2-approximation algorithm and a fully polynomial-time approximation scheme are given for the problem.