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

Author(s):  
Nhan-Quy Nguyen ◽  
Farouk Yalaoui ◽  
Lionel Amodeo ◽  
Hicham Chehade ◽  
Pascal Toggenburger
2014 ◽  
Vol 19 (6) ◽  
pp. 503-514 ◽  
Author(s):  
Wei-Che Hsu ◽  
Jay M. Rosenberger ◽  
Neelesh V. Sule ◽  
Melanie L. Sattler ◽  
Victoria C. P. Chen

2016 ◽  
Vol 253 (3) ◽  
pp. 570-583 ◽  
Author(s):  
Luiz H. Cherri ◽  
Leandro R. Mundim ◽  
Marina Andretta ◽  
Franklina M.B. Toledo ◽  
José F. Oliveira ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document