Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

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

(1) , (1) , (1) , (1) , (2)
1
2

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.
Not file

Dates and versions

hal-02551757 , version 1 (23-04-2020)

Identifiers

Cite

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⟩

Collections

CNRS UTT LOSI
27 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More