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

Cuixia Miao
2014 Abstract and Applied Analysis  
We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model ispj=aj+αtand of the second model ispj=a+αjt. The objective is to minimize the makespan. We presentO(n log n)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.
doi:10.1155/2014/495187 fatcat:j6sfmkrfrvaxpoziarmlqup2fq