Resource-constrained Modulo scheduling

Abstract : This chapter presents an unusual application of the RCPSP, namely an instruction scheduling problem for very long instruction word processors. The specific characteristics of these processors and the cyclic nature of the problem yields a modulo RCPSP with minimum and maximum time lags. New integer linear programming formulations are proposed and an efficient large neighborhood search technique is used to solve near-optimally large industrial problems in a few minutes.
Type de document :
Chapitre d'ouvrage
Christian Artigues, Sophie Demassey and Emmanuel Néron. Resource Constrained Project Scheduling. Models, Algorithms, Extensions and Applications., ISTE-WILEY, pp.267-277, 2008, Control Systems, Robotics and Manufacturing Series
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00271651
Contributeur : Christian Artigues <>
Soumis le : mercredi 9 avril 2008 - 18:35:57
Dernière modification le : samedi 27 octobre 2018 - 01:29:13

Identifiants

  • HAL Id : hal-00271651, version 1

Citation

Benoît De Dinechin, Christian Artigues, Sadia Azem. Resource-constrained Modulo scheduling. Christian Artigues, Sophie Demassey and Emmanuel Néron. Resource Constrained Project Scheduling. Models, Algorithms, Extensions and Applications., ISTE-WILEY, pp.267-277, 2008, Control Systems, Robotics and Manufacturing Series. 〈hal-00271651〉

Partager

Métriques

Consultations de la notice

100