Scheduling to a Common Due Date on Unrelated Parallel-Machine with Deteriorating Jobs
2012 ◽
Vol 605-607
◽
pp. 521-527
◽
Keyword(s):
Due Date
◽
This paper explores scheduling to a common due date on unrelated machines with resource allocation and deteriorating jobs. The main purpose is to determine the optimal resource allocation and the optimal job sequence so that the cost function that includes the sum of earliness, tardiness, and resource cost will be minimized. Result showed that the problem is polynomial time solvable when the number of machine is fixed.
2017 ◽
Vol 2
(2)
◽
pp. 33-42
◽
Keyword(s):
Keyword(s):
Keyword(s):