Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2014 (2014), Article ID 495187, 10 pages
Research Article

Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan

1School of Mathematical Sciences, Qufu Normal University, Qufu, Shandong 273165, China
2School of Physics and Engineering, Qufu Normal University, Qufu, Shandong 273165, China

Received 8 April 2014; Accepted 21 June 2014; Published 23 July 2014

Academic Editor: Fabio M. Camilli

Copyright © 2014 Cuixia Miao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is and of the second model is . The objective is to minimize the makespan. We present time algorithms for the single-machine problems, respectively. And we propose fully polynomial time approximation schemes to solve the identical-parallel-machine problem and uniform-parallel-machine problem, respectively.