Single-machine scheduling problems with the effects of learning and deterioration

Ji-Bo Wang

Omega, 2007, vol. 35, issue 4, pages 397-402

Abstract: In this paper, we consider the single-machine scheduling problems with the effects of learning and deterioration. By the effects of learning and deterioration, we mean that job processing times are defined by functions of their starting times and positions in the sequence. It is shown that even with the introduction of learning effect and deteriorating jobs to job processing times, single-machine makespan and sum of completion times (square) minimization problems remain polynomially solvable, respectively. But for the following objective functions: the weighted sum of completion times and the maximum lateness, this paper proves that the WSPT rule and the EDD rule can construct the optimal sequence under some special cases, respectively.

Keywords: Scheduling; Single; machine; Learning; effect; Deteriorating; jobs (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (9) Track citations by RSS feed

Downloads: (external link)
http://www.sciencedirect.com/science/article/B6VC4 ... c0ce73ccffd0922ff08f
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: http://EconPapers.repec.org/RePEc:eee:jomega:v:35:y:2007:i:4:p:397-402

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is edited by B. Lev

More articles in Omega from Elsevier
Series data maintained by Wendy Shamier ().