Skip to main content

An Adaptive Search for the Response Time Variability Problem

Salhi, Said, Garcia-Villoria, Alberto (2012) An Adaptive Search for the Response Time Variability Problem. Journal of the Operational Research Society, 63 (5). pp. 597-605. ISSN 0160-5682. (doi:10.1057/jors.2011.46) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:29588)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1057/jors.2011.46

Abstract

The Response Time Variability Problem (RTVP) is an NP-hard combinatorial scheduling problem,

real-world applications in mixed-model assembly lines, multi-threaded computer systems, broadcast of

sequenced in such a way that the variability in the time between the points at which they receive the

into a poor solution by incorporating a look ahead strategy suitable for this particular scheduling

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 > H Social Sciences (General)
Divisions: Faculties > Social Sciences > Kent Business School
Faculties > Social Sciences > Kent Business School > Management Science
Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User: Said Salhi
Date Deposited: 29 May 2012 12:00 UTC
Last Modified: 08 Feb 2020 04:04 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/29588 (The current URI for this page, for reference purposes)
Salhi, Said: https://orcid.org/0000-0002-3384-5240
  • Depositors only (login required):