A note on due-date assignment and single machine scheduling with a learning/aging effect

Pei-Chann Chang, Shih-Hsin Chen and V. Mani

International Journal of Production Economics, 2009, vol. 117, issue 1, 142-149

Abstract: This paper considers the learning/aging effect in an n job single machine scheduling problem with common due date. The objective is to determine the optimal common due date and the optimal sequence of jobs that minimizes a cost function in the presence of learning/aging effect. The cost function depends on the individual job earliness and tardiness values; i.e., . This is a well-known problem when the learning/aging effect is not considered and it is shown in earlier studies that there are more than one optimal sequence and optimal common due dates. It is shown in earlier studies that there are 2r-1 optimal sequences to this problem if n is odd, and 2r optimal sequences if n is even. The value of r is (n+1)/2 if n is odd, and the value of r is n/2 if n is even. In this paper, we derive two bounds B[alpha] and for the learning index [alpha]. We show that when B[alpha]

Keywords: Scheduling; Single-machine; Learning; effect; Due-date; assignment (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(08)00350-2
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:117:y:2009:i:1:p:142-149

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 ().