Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine

Shisheng Li, C.T. Ng and Jinjiang Yuan

International Journal of Production Economics, 2011, vol. 131, issue 2, 747-751

Abstract: This paper considers the problem of scheduling deteriorating jobs and due date assignment on a single machine. The actual processing time of a job is a linear increasing function of its starting time. The problem is to determine the optimal due dates and the processing sequence simultaneously to minimize costs for earliness, due date assignment and weighted number of tardy jobs. We present polynomial-time algorithms to solve the problem in the case of two popular due date assignment methods: CON and SLK.

Keywords: Scheduling; Deteriorating; jobs; CON/SLK; due; date; assignment (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(11)00122-8
Full text for ScienceDirect subscribers only

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:eee:proeco:v:131:y:2011:i:2:p:747-751

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().