Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal-utt.archives-ouvertes.fr/hal-02551757
Contributor : Jean-Baptiste Vu Van Connect in order to contact the contributor
Submitted on : Thursday, April 23, 2020 - 10:06:34 AM
Last modification on : Friday, August 27, 2021 - 3:14:08 PM

Identifiers

Collections

UTT | CNRS

Citation

Nhan-Quy Nguyen, Farouk Yalaoui, Lionel Amodeo, Hicham Chehade, Pascal Toggenburger. Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models. ACIIDS 2016, 8th Asian Conference on Intelligent Information and Database Systems, Mar 2016, Da Nang, Vietnam. pp.286-295, ⟨10.1007/978-3-662-49390-8_28⟩. ⟨hal-02551757⟩

Share

Metrics

Record views

23