.png){kind=icon}
Return
Two due date assignment problems with position-dependent processing time on a single-machine
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.01.017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The focus of this study is to analyze single-machine scheduling and due date assignment problems with position-dependent processing time. Two generally positional deterioration models and two frequent due date assignment methods are investigated. The objective functions include the cost of changing the due dates, the total cost of positional weight earliness, and the total cost of the discarded jobs that cannot be completed by their due dates. We conclude that the problems are polynomial time solvable. Significantly enough, after assessing the special case of each problem, this research found out that they can be optimally solved by lower order algorithms. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Common due date
Slack due date
Position-dependent processing time
Dynamic programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
no more
no more