Bounded single-machine parallel-batch scheduling with release dates and rejection
نویسندگان
چکیده
منابع مشابه
Bounded single-machine parallel-batch scheduling with release dates and rejection
We consider the bounded single-machine parallel-batch scheduling problem with release dates and rejection. A job is either rejected, in which case a certain penalty has to be paid, or accepted and then processed on the machine. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of the rejected jobs. When the jobs have identical release dates, we pres...
متن کاملThe unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
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 makespa...
متن کاملSingle Machine Scheduling with Release Dates
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other on a completiontime formulation. We show their equivalence by proving that a O(n logn) greedy algorithm leads to optimal solutions to both relax...
متن کاملParallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection
We consider the unbounded parallel batch scheduling with deterioration, release dates, and rejection. Each job is either accepted and processed on a single batching machine, or rejected by paying penalties. The processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of t...
متن کاملSingle machine batch scheduling problem with family setup times and release dates to minimize makespan
In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an O n n m + 1 m time dynamic programming algorithm and an O(mk k P 2k−1) time dynamic programming algorithm for the problem, where n is the number of jobs, m is the number of families, k is the number of di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2009
ISSN: 0305-0548
DOI: 10.1016/j.cor.2008.12.003