.png){kind=icon}
.png){kind=icon}
Return
Single machine scheduling and due date assignment with positionally dependent processing times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.07.044.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Single machine scheduling
Common due date assignment
SLK due date assignment
Positionally dependent processing times
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
Papers:
2.2W
Citations:
6.4W