Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A branch and bound algorithm for the response time variability problem

Autor
García-Villoria, A.; Corominas, A.; Delorme, X.; Dolgui, A.; Kubiak, W.; Pastor, Rafael
Tipus d'activitat
Article en revista
Revista
Journal of scheduling
Data de publicació
2013-04
Volum
16
Número
2
Pàgina inicial
243
Pàgina final
252
DOI
https://doi.org/10.1007/s10951-012-0277-x Obrir en finestra nova
Projecte finançador
DELIPYMER. Diseño y equilibrado de líneas de montaje en entornos realistes
Repositori
http://hdl.handle.net/2117/17646 Obrir en finestra nova
URL
http://link.springer.com/article/10.1007%2Fs10951-012-0277-x Obrir en finestra nova
Resum
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 so...
Citació
García-Villoria, A. [et al.]. A branch and bound algorithm for the response time variability problem. "Journal of scheduling", 22 Juny 2012, núm. June 2012, p. 1-10.
Paraules clau
Branch and bound, Fair sequences, Response time variability, Scheduling
Grup de recerca
SCOM - Supply Chain and Operations Management

Participants