Batch Scheduling with Proportional-Linear Deterioration and Outsourcing

Cuixia Miao, Fanxiao Meng, Juan Zou and Binglin Jia

Mathematical Problems in Engineering, 2017, vol. 2017, 1-5

Abstract:

We consider the bounded parallel-batch scheduling with proportional-linear deterioration and outsourcing, in which the actual processing time is or . A job is either accepted and processed in batches on a single machine by manufactures themselves or outsourced to the third party with a certain penalty having to be paid. The objective is to minimize the maximum completion time of the accepted jobs and the total penalty of the outsourced jobs. For the model, when all the jobs are released at time zero, we show that the problem is NP-hard and present a pseudo-polynomial time algorithm, respectively. For the model, when the jobs have distinct ( ) release dates, we provide a dynamic programming algorithm, where is the number of jobs.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/6093029.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/6093029.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:jnlmpe:6093029

DOI: 10.1155/2017/6093029

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().