A branch and bound algorithm for the response time variability problem

Abstract : The response time variability problem (RTVP) is an NP-hard scheduling problem that has been studied intensively recently and has a wide range of real-world applications in mixed-model assembly lines, multithreaded computer systems, network environments and others. The RTVP arises whenever products, clients or jobs need to be sequenced in order to minimise the variability in the time between two successive points at which they receive the necessary resources. To date, the best exact method for solving this problem is a mixed integer linear programming (MILP) model, which solves to optimality most of instances with up to 40 units to be scheduled in a reasonable amount of time. The goal of this paper is to increase the size of the instances that can be solved to optimality. We have designed an algorithm based on the branch and bound (B&B) technique to take advantage of the particular features of the problem. Our computational experiments show that the B&B algorithm is able to solve larger instances with up to 55 units to optimality in a reasonable time.
Type de document :
Article dans une revue
Journal of Scheduling, Springer Verlag, 2013, Volume 16 (Issue 2), pp 243-252. 〈10.1007/s10951-012-0277-x〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00709667
Contributeur : Florent Breuil <>
Soumis le : mardi 19 juin 2012 - 11:05:46
Dernière modification le : lundi 29 janvier 2018 - 13:04:01

Lien texte intégral

Identifiants

Citation

Alberto García-Villoria, Albert Corominas, Xavier Delorme, Alexandre Dolgui, Wieslaw Kubiak, et al.. A branch and bound algorithm for the response time variability problem. Journal of Scheduling, Springer Verlag, 2013, Volume 16 (Issue 2), pp 243-252. 〈10.1007/s10951-012-0277-x〉. 〈emse-00709667〉

Partager

Métriques

Consultations de la notice

180