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

Cuixia Miao

Abstract and Applied Analysis, 2014, vol. 2014, 1-10

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/495187.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/495187.xml (text/xml)

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:hin:jnlaaa:495187

DOI: 10.1155/2014/495187

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().