Showing 1 - 10 of 53
This paper addresses the parallel machine scheduling problem in which the jobs have distinct due dates with earliness and tardiness costs. New lower bounds are proposed for the problem, they can be classed into two families. First, two assignment-based lower bounds for the one-machine problem...
Persistent link: https://www.econbiz.de/10005283368
Persistent link: https://www.econbiz.de/10007984423
Persistent link: https://www.econbiz.de/10003709947
Persistent link: https://www.econbiz.de/10003896696
Persistent link: https://www.econbiz.de/10003952532
Persistent link: https://www.econbiz.de/10012663346
Persistent link: https://www.econbiz.de/10012164809
Persistent link: https://www.econbiz.de/10012117021
Persistent link: https://www.econbiz.de/10012542552
Persistent link: https://www.econbiz.de/10005355031