Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models.

Nhan-Quy Nguyen, Farouk Yalaoui, Lionel Amodeo, Hicham Chehade, Pascal Toggenburger

Browse the full ACIIDS paper archive.