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

Cuixia Miao

Abstract and Applied Analysis, 2014, vol. 2014, issue 1

Abstract: 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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/495187

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2014:y:2014:i:1:n:495187

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().