Back to Search
Start Over
Minimizing the makespan on a single parallel batching machine
- Source :
-
Theoretical Computer Science . Feb2010, Vol. 411 Issue 7-9, p1140-1145. 6p. - Publication Year :
- 2010
-
Abstract
- Abstract: In this paper, we consider the problem of scheduling with release dates and rejection on a single parallel batching machine, where the jobs have non-identical sizes. Our objective is to minimize the makespan of the accepted jobs plus the total penalty of the rejected jobs. First, we give a polynomial time approximation scheme (PTAS) for the case where jobs can be split. Then, we propose a -approximation algorithm for the special case with identical release dates. Finally, we present an approximation algorithm for the general problem with worst-case ratio , where is an arbitrarily small constant. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 411
- Issue :
- 7-9
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 47827656
- Full Text :
- https://doi.org/10.1016/j.tcs.2009.12.008