[article] 
inJournal of the operational research society (JORS) > Vol. 63 N° 5 (Mai 2012) . - pp. 597–605

Titre :	An adaptive search for the response time variability problemstar
Type de document :	texte imprimé
Auteurs :	Samir Salhi, Auteur ; A. García-Villoria, Auteur
Année de publication :	2012
Article en page(s) :	pp. 597–605
Note générale :	Recherche opérationnelle
Langues :	Anglais (eng)
Mots-clés :	Response time variability Heuristics Adaptive search Scheduling Fair sequences
Index. décimale :	001.424
Résumé :	The Response Time Variability Problem (RTVP) is an NP-hard combinatorial scheduling problem, which has recently been reported and formalised in the literature. This problem has a wide range of real-world applications in mixed-model assembly lines, multi-threaded computer systems, broadcast of commercial videotapes and others. The RTVP arises whenever products, clients or jobs need to be sequenced in such a way that the variability in the time between the points at which they receive the necessary resources is minimised. We propose a greedy but adaptive heuristic that avoids being trapped into a poor solution by incorporating a look ahead strategy suitable for this particular scheduling problem. The proposed heuristic outperforms the best existing methods, while being much faster and easier to understand and to implement.
DEWEY :	001.424
ISSN :	0160-5682
En ligne :	http://www.palgrave-journals.com/jors/journal/v63/n5/abs/jors201146a.html

[article] An adaptive search for the response time variability problemstar [texte imprimé] / Samir Salhi, Auteur ; A. García-Villoria, Auteur . - 2012 . - pp. 597–605.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 5 (Mai 2012) . - pp. 597–605

Mots-clés :	Response time variability Heuristics Adaptive search Scheduling Fair sequences
Index. décimale :	001.424
Résumé :	The Response Time Variability Problem (RTVP) is an NP-hard combinatorial scheduling problem, which has recently been reported and formalised in the literature. This problem has a wide range of real-world applications in mixed-model assembly lines, multi-threaded computer systems, broadcast of commercial videotapes and others. The RTVP arises whenever products, clients or jobs need to be sequenced in such a way that the variability in the time between the points at which they receive the necessary resources is minimised. We propose a greedy but adaptive heuristic that avoids being trapped into a poor solution by incorporating a look ahead strategy suitable for this particular scheduling problem. The proposed heuristic outperforms the best existing methods, while being much faster and easier to understand and to implement.
DEWEY :	001.424
ISSN :	0160-5682
En ligne :	http://www.palgrave-journals.com/jors/journal/v63/n5/abs/jors201146a.html