Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect

Zhang Xingong and Wang Yong

Applied Mathematics and Computation, 2015, vol. 250, issue C, 628-635

Abstract: This paper studies systems that can be modeled by single-machine scheduling problems with due date assignment. The actual job processing time is a function of the sum of the processing times of the jobs already processed. The due date assignment methods include the common due date (CON) and the slack due date (SLK). The problem is to determine optimal due date values that minimize objective functions which includes the cost of changing the due dates, a possible penalty for the total earliness of the scheduled jobs and the total penalty for discarding jobs. For the common due date and slack due date, we give polynomial-time dynamic programming algorithms to find the optimal jobs sequence, respectively.

Keywords: Single-machine scheduling; Learning effect; CON due date assignment; SLK due date assignment (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314015173
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:apmaco:v:250:y:2015:i:c:p:628-635

DOI: 10.1016/j.amc.2014.11.011

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().