Online Non-preemptive Scheduling to Minimize Maximum Weighted Flow-time on Related Machines

Giorgio Lucarelli 1 Benjamin Moseley 2 Kim Thang Nguyen 3 Abhinav Srivastav 3 Denis Trystram 4
1 LCOMS - Laboratoire de Conception, Optimisation et Modélisation des Systèmes
2 Tepper School of Business
3 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
4 LIG - Laboratoire d'Informatique de Grenoble
Document type :
Conference papers
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-02416979
Contributor : Frédéric Davesne <>
Submitted on : Tuesday, December 17, 2019 - 10:16:56 PM
Last modification on : Wednesday, January 8, 2020 - 1:34:08 AM

Identifiers

  • HAL Id : hal-02416979, version 1

Collections

UNIV-EVRY | IBISC | IBISC-AROBAS | LIG | UNIV-LORRAINE | LCOMS-UL | CNRS | UGA | UNIV-PARIS-SACLAY

Citation

Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram. Online Non-preemptive Scheduling to Minimize Maximum Weighted Flow-time on Related Machines. 14th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2019), Jun 2019, Renesse, Netherlands. ⟨hal-02416979⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

19

Contact

Informations

CCSD