.png){kind=icon}
.png){kind=icon}
Return
Bounded single-machine parallel-batch scheduling with release dates and rejection
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2008.12.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 present a polynomial-time algorithm. When the jobs have a constant number of release dates, we give a pseudo-polynomial-time algorithm. For the general problem, we provide a 2-approximation algorithm and a polynomial-time approximation scheme. (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Parallel-batch
Rejection penalty
Polynomial-time approximation scheme
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W