Bounded parallel-batch scheduling on unrelated parallel machines

Authors:
Cuixia Miao;Yuzhong Zhang;Chengfei Wang
Affiliations:
School of Operations Research and Management Sciences, Qufu Normal University, Rizhao, Shandong, China and School of Mathematical Sciences, Qufu Normal University, Qufu, Shandong, China;School of Operations Research and Management Sciences, Qufu Normal University, Rizhao, Shandong, China;School of Operations Research and Management Sciences, Qufu Normal University, Rizhao, Shandong, China
Venue:
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Year:
2010

Citing 6
Cited 1

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Multiprocessor Scheduling with Rejection

SIAM Journal on Discrete Mathematics
Bounded single-machine parallel-batch scheduling with release dates and rejection

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

Theoretical Computer Science
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

A survey on offline scheduling with rejection

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the bounded parallel-batch scheduling problem on unrelated parallel machines. Problems Rm|B|F are NP-hard for any objective function F. For this reason, we discuss the special case with pij = pi for i = 1, 2, ..., m, j = 1, 2, ... , n. We give optimal algorithms for the general scheduling to minimize total weighted completion time, makespan and the number of tardy jobs. And we design pseudo-polynomial time algorithms for the case with rejection penalty to minimize the makespan and the total weighted completion time plus the total penalty of the rejected jobs, respectively.