Efficient priority rules for the resource-constrained project scheduling problem / Rainer Kolisch in Journal of operations management, Vol. 14 N°3 (Septembre 1996)  

Public ISBD [article]  inJournal of operations management > Vol. 14 N°3 (Septembre 1996) . - pp. 179–192 Titre : Efficient priority rules for the resource-constrained project scheduling problem Type de document : texte imprimé Auteurs : Rainer Kolisch, Auteur Année de publication : 2007 Article en page(s) : pp. 179–192 Note générale : Génie Industriel Langues : Anglais (eng) Mots-clés : Resource-constrained project scheduling Paraliel scheme Priority rules Single-pass heuristics Experimental evaluation Résumé : Resource-constrained project scheduling is a core problem for many industrial applications, e.g. finite scheduling systems and the planning of business re-engineering processes. In order to solve these problems commercial systems employ classical priority rules. We review one of them, the well-known RSM priority rule. A detailed analysis of this rule, reveals that it does not reflect the finite capacity of resources properly. Consequently, this leads to poor solutions. Hence, an improved RSM priority rule is derived and two new priority rules are developed which extend the well-known precedence based Minimum SLacK priority rule (MSLK) to a precedence and resource based slack priority rule, respectively. On the basis of a comprehensive experimental investigation we provide new insight into the performance of classical and new rules. Furthermore, we show that one of the new rules is significantly better than the classical rules and hence should be employed in project scheduling systems. DEWEY : 658.57 ISSN : 0272-6963 En ligne : http://www.sciencedirect.com/science/article/pii/0272696395000321 [article] Efficient priority rules for the resource-constrained project scheduling problem [texte imprimé] / Rainer Kolisch, Auteur . - 2007 . - pp. 179–192. Génie Industriel Langues : Anglais (eng) in Journal of operations management > Vol. 14 N°3 (Septembre 1996) . - pp. 179–192 Mots-clés : Resource-constrained project scheduling Paraliel scheme Priority rules Single-pass heuristics Experimental evaluation Résumé : Resource-constrained project scheduling is a core problem for many industrial applications, e.g. finite scheduling systems and the planning of business re-engineering processes. In order to solve these problems commercial systems employ classical priority rules. We review one of them, the well-known RSM priority rule. A detailed analysis of this rule, reveals that it does not reflect the finite capacity of resources properly. Consequently, this leads to poor solutions. Hence, an improved RSM priority rule is derived and two new priority rules are developed which extend the well-known precedence based Minimum SLacK priority rule (MSLK) to a precedence and resource based slack priority rule, respectively. On the basis of a comprehensive experimental investigation we provide new insight into the performance of classical and new rules. Furthermore, we show that one of the new rules is significantly better than the classical rules and hence should be employed in project scheduling systems. DEWEY : 658.57 ISSN : 0272-6963 En ligne : http://www.sciencedirect.com/science/article/pii/0272696395000321

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire