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

Abstract EN

We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is pj=aj+αt and of the second model is pj=a+αjt.

The objective is to minimize the makespan.

We present O(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.