Due-Window Assignment Scheduling with Variable Job Processing Times
Keyword(s):
We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.
2015 ◽
Vol 32
(06)
◽
pp. 1550045
◽
Keyword(s):
2014 ◽
Vol 644-650
◽
pp. 2026-2029
Keyword(s):
2013 ◽
Vol 344
◽
pp. 275-278
Keyword(s):
2020 ◽
Vol 2020
◽
pp. 1-7
◽
2014 ◽
Vol 31
(05)
◽
pp. 1450036
◽
Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects
2015 ◽
Vol 32
(03)
◽
pp. 1550014
◽
2011 ◽
Vol 28
(04)
◽
pp. 511-521
◽