Abstract
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.
Citation
Cuixia Miao. "Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan." Abstr. Appl. Anal. 2014 1 - 10, 2014. https://doi.org/10.1155/2014/495187