Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling

In this work we propose a Lagrangian relaxation of a time indexed integer programming formulation to compute a lower bound for the resource-constrained modulo scheduling problem (RCMSP). Solving the RCMSP consists in finding a 1-periodic schedule minimizing the period subject to both temporal and re...

Full description

Saved in:
Bibliographic Details
Published inElectronic notes in discrete mathematics Vol. 36; pp. 191 - 198
Main Authors Ayala, Maria, Artigues, Christian, Gacias, Bernat
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.08.2010
Subjects
lagrangian relaxation
minimum period
modulo scheduling
resource constraints
lagrangian relaxation
modulo scheduling
resource constraints
minimum period
Online AccessGet full text
ISSN1571-0653
1571-0653
DOI10.1016/j.endm.2010.05.025

Cover

More Information
Summary:In this work we propose a Lagrangian relaxation of a time indexed integer programming formulation to compute a lower bound for the resource-constrained modulo scheduling problem (RCMSP). Solving the RCMSP consists in finding a 1-periodic schedule minimizing the period subject to both temporal and resource constraints. This work is inspired by Möhring et al results [Möhring, R.H., A. S. Schulz, F. Stork and M. Uetz Solving Project Scheduling Problems by Minimum Cut Computations, Management Science. 49 (2003), 330–350] for the (non cyclic) resource constrained project scheduling problem, where each subproblem solved within the subgradient optimization is equivalent to a minimum cut problem. Experimental results, presented on instruction scheduling instances from the STMicroelectronics ST200 VLIW processor family, underline the interest of the proposed method.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2010.05.025