Showing 1 - 10 of 128
Persistent link: https://www.econbiz.de/10005417791
Persistent link: https://www.econbiz.de/10006268248
Persistent link: https://www.econbiz.de/10006229784
Persistent link: https://www.econbiz.de/10006170150
Persistent link: https://www.econbiz.de/10005318418
Persistent link: https://www.econbiz.de/10007757855
Persistent link: https://www.econbiz.de/10007772628
We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard. We propose a heuristic and a lower bound based on job splitting and the Viswanathkumar and Srinivasan procedure. The test on more than 2000 instances shows that...
Persistent link: https://www.econbiz.de/10008865379
Persistent link: https://www.econbiz.de/10001999920