.png){kind=icon}
.png){kind=icon}
Return
Study on Multiple Due-Windows Assignment Scheduling with Learning and Deteriorating Effects
.png){kind=icon}
PRE
AI
DOI：10.1142/S0217595926500016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper focuses on the single-machine scheduling problems with multiple due-windows and learning and deteriorating effects, where the actual processing time of the job is a function of its starting time and position in a sequence. The aim is to minimize the weighted sum of the earliness, tardiness and the due-windows costs. Under common due-windows and slack due-windows, the optimal properties of the problems are analyzed and each of the above problems can be transformed into an assignment problem. An algorithm with a time complexity of O(n(3)) is presented, and the effectiveness of the algorithm is verified by an example, where n is the number of jobs.
Keywords:
Scheduling
single-machine
multiple due-windows assignment
learning and deteriorating effect
Journal
A
IF:
1
Papers:
58
Citations:
0