Showing 1 - 10 of 24
Persistent link: https://www.econbiz.de/10005347737
Persistent link: https://www.econbiz.de/10005152101
The purpose of this paper is to propose a new branch-and-bound algorithm for a class of scheduling problems to minimize total tardiness on identical parallel machines. In this algorithm, the Lagrangian relaxation technique is applied to obtain a tight lower bound. In addition, the job dominance...
Persistent link: https://www.econbiz.de/10005318231
Persistent link: https://www.econbiz.de/10008422921
Persistent link: https://www.econbiz.de/10007991319
Persistent link: https://www.econbiz.de/10008233339
Persistent link: https://www.econbiz.de/10003889205
Persistent link: https://www.econbiz.de/10003930845
Persistent link: https://www.econbiz.de/10009384599
Persistent link: https://www.econbiz.de/10006750068