Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times
2012 ◽
Vol 2012
◽
pp. 1-9
◽
Keyword(s):
We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing (or decreasing) functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum of completion times minimization problems remains polynomially solvable under the agreeable conditions.
2008 ◽
Vol 115
(1)
◽
pp. 128-133
◽
Keyword(s):
2014 ◽
Vol 513-517
◽
pp. 2149-2152
2014 ◽
Vol 234
◽
pp. 286-292
◽
Keyword(s):
2009 ◽
Vol 49
(5-8)
◽
pp. 765-772
◽
Keyword(s):
2009 ◽
Vol 35
(10)
◽
pp. 1290-1295
◽
2005 ◽
Vol 162
(1)
◽
pp. 112-121
◽
2015 ◽
Vol 47
(10)
◽
pp. 2402-2410
◽
Keyword(s):
2009 ◽
Vol 35
(10)
◽
pp. 1290-1295
◽