In this paper we report two mixed integer linear programming models to resolve the malleable jobs scheduling problem with single resource. Jobs’ release dates and deadlines are taken into account. The total amount of available resource of the system is variable at different times. Numerical experimentation is conducted to evaluate the performance variability between two introduced models. The objective of this optimization problem is to minimize the total weighted completion time.
CITATION STYLE
Nguyen, N. Q., Yalaoui, F., Amodeo, L., Chehade, H., & Toggenburger, P. (2016). Solving a malleable jobs scheduling problem to minimize total weighted completion times by mixed integer linear programming models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9622, pp. 286–295). Springer Verlag. https://doi.org/10.1007/978-3-662-49390-8_28
Mendeley helps you to discover research relevant for your work.