Lower bounds for Scheduling Problems with production and consumption of resources - Archive ouverte HAL Access content directly
Conference Papers Year :

Lower bounds for Scheduling Problems with production and consumption of resources

Abstract

This paper deals with the Event Scheduling Problem with Consumption and Production of Resources called ESPCPR. This problem is an extension of the Resource Constrained Project Scheduling Problem (RCPSP) where we have the property to produce or consume the resources. The aim of this paper is to introduce for ESPCPR three new lower bounds whose calculation serves two goals. First, they can help in deleting useless nodes in a branch-and-bound tree. Second, they may help in evaluating the efficiency of heuristic methods when optimal solutions are not available.
Fichier principal
Vignette du fichier
mista.pdf (88.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01261230 , version 1 (25-01-2016)

Identifiers

  • HAL Id : hal-01261230 , version 1

Cite

Abderrahim Sahli, Jacques Carlier, Aziz Moukrim. Lower bounds for Scheduling Problems with production and consumption of resources. MISTA 2015 , Aug 2015, Prague, Czech Republic. ⟨hal-01261230⟩
276 View
131 Download

Share

Gmail Facebook Twitter LinkedIn More