Skip to main content

An adaptive Search for the Response Time Variability Problem1

Salhi, Said, Garcia-Villoria, Alberto (2011) An adaptive Search for the Response Time Variability Problem1. Journal of the Operational Research Society, 63 . pp. 597-605. ISSN (2012) 63, 597–605. doi:10.1057/jors.2011.46; Published online 13 July 2011. (doi:10.1057/jors.2011.46)

Abstract

Abstract. 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, multithreaded 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.

Item Type: Article
DOI/Identification number: 10.1057/jors.2011.46
Uncontrolled keywords: response time variability, heuristics, adaptive search, scheduling, fair sequences
Subjects: H Social Sciences > H Social Sciences (General)
Divisions: Faculties > Social Sciences > Kent Business School > Business process/operations
Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User: Said Salhi
Date Deposited: 31 Oct 2013 10:50 UTC
Last Modified: 29 May 2019 11:13 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/35863 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year