Due-Window Assignment and Resource Allocation Scheduling with Truncated Learning Effect and Position-Dependent Weights
Keyword(s):
This paper studies single-machine due-window assignment scheduling problems with truncated learning effect and resource allocation simultaneously. Linear and convex resource allocation functions under common due-window (CONW) assignment are considered. The goal is to find the optimal due-window starting (finishing) time, resource allocations and job sequence that minimize a weighted sum function of earliness and tardiness, due window starting time, due window size, and total resource consumption cost, where the weight is position-dependent weight. Optimality properties and polynomial time algorithms are proposed to solve these problems.
2020 ◽
Vol 37
(01)
◽
pp. 1950031
2011 ◽
Vol 28
(04)
◽
pp. 511-521
◽
2019 ◽
Vol 52
(4)
◽
pp. 669-686
◽
Keyword(s):
2014 ◽
Vol 31
(01)
◽
pp. 1450004
◽
2017 ◽
Vol 13
(5)
◽
pp. 0-0
Keyword(s):
2017 ◽
Vol 56
(1-2)
◽
pp. 715-725
◽
Keyword(s):
2014 ◽
Vol 31
(05)
◽
pp. 1450036
◽
Keyword(s):