Minimizing Total Weighted Completion Time on Single Machine with Past-Sequence-Dependent Setup Times and Exponential Time-Dependent and Position-Dependent Learning Effects

Kaibiao Sun and Hongxing Li

Discrete Dynamics in Nature and Society, 2009, vol. 2009, 1-10

Abstract:

This paper addresses a single-machine problem in which the past-sequence-dependent (p-s-d) setup times and exponential time-dependent and position-dependent learning effects are considered. By the exponential time-dependent learning effect, it means that the processing time of a job is defined by an exponent function of the total actual processing time of the already processed jobs. The setup times are proportional to the length of the already processed jobs. The aim is to minimize the total weighted completion time, this is an NP-hard problem. Under certain conditions, it is shown that the classical WSPT rule is optimal for the problem.

Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2009/970510.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2009/970510.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:jnddns:970510

DOI: 10.1155/2009/970510

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().