Online Non-preemptive Scheduling to Minimize Maximum Weighted Flow-time on Related Machines - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

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

Domaines

Recherche opérationnelle [math.OC]

Frédéric Davesne  : Connectez-vous pour contacter le contributeur

https://hal.science/hal-02416979

Soumis le : mardi 17 décembre 2019-22:16:56

Dernière modification le : vendredi 5 avril 2024-03:14:10

Fichier non déposé

Dates et versions

hal-02416979 , version 1 (17-12-2019)

Identifiants

  • HAL Id : hal-02416979 , version 1

Citer

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UGA CNRS UNIV-EVRY LIG IBISC IBISC-AROBAS UNIV-LORRAINE TDS-MACS LCOMS-UL UNIV-PARIS-SACLAY MIAI ANR GS-ENGINEERING GS-COMPUTER-SCIENCE LIG_SIDCH
52 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More