Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan
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, respe...
| Published in: | Abstract and Applied Analysis |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Online Access: | http://dx.doi.org/10.1155/2014/495187 |