Salhi, S. and Garcia-Villoria, A. (2012) An Adaptive Search for the Response Time Variability Problem. Journal of the Operational Research Society , 63 (5). pp. 597-605. ISSN 0160-5682 .
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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.
|Uncontrolled keywords:||response time variability; heuristics; adaptive search; scheduling; fair sequences|
|Subjects:||H Social Sciences
H Social Sciences > H Social Sciences (General)
|Divisions:||Faculties > Social Sciences > Kent Business School
Faculties > Social Sciences > Kent Business School > Management Science
|Depositing User:||Cathy Norman|
|Date Deposited:||29 May 2012 12:00|
|Last Modified:||29 May 2012 13:54|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/29588 (The current URI for this page, for reference purposes)|
- Depositors only (login required):