%0 Conference Proceedings
%T Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models
%+ Laboratoire d'Optimisation des Systèmes Industriels (LOSI)
%+ Park'nPlug
%A Nguyen, Nhan Quy
%A Yalaoui, Farouk
%A Amodeo, Lionel
%A Chehade, Hicham
%A Toggenburger, Pascal
%< avec comité de lecture
%B ACIIDS 2016, 8th Asian Conference on Intelligent Information and Database Systems
%C Da Nang, Vietnam
%3 Lecture Notes in Computer Science
%V 9622
%P 286-295
%8 2016-03-14
%D 2016
%R 10.1007/978-3-662-49390-8_28
%Z Computer Science [cs]/Operations Research [cs.RO]Conference papers
%X 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.
%G English
%L hal-02551757
%U https://utt.hal.science/hal-02551757
%~ CNRS
%~ UNIV-TROYES
%~ UTT
%~ LOSI