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

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 slac...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Applied mathematics and computation Ročník 250; s. 628 - 635
Hlavní autori: Xingong, Zhang, Yong, Wang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.01.2015
Predmet:
Algorithms
Computation
CON due date assignment
Cost engineering
Due dates
Learning
Learning effect
Mathematical analysis
Mathematical models
Optimization
Scheduling
Single-machine scheduling
SLK due date assignment
Single-machine scheduling
CON due date assignment
Learning effect
SLK due date assignment
ISSN:0096-3003, 1873-5649
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2014.11.011