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) (KAR id:35863)

PDF
Language: English
Download (368kB) Preview
[img]
Preview
Official URL
https://doi.org/10.1057/jors.2011.46

Abstract

Abstract. The Response Time Variability Problem (RTVP) is an NP-hard combinatorial

problem has a wide range of real-world applications in mixed-model assembly lines, multithreaded

whenever products, clients or jobs need to be sequenced in such a way that the variability in

propose a greedy but adaptive heuristic that avoids being trapped into a poor solution by

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: 08 Feb 2020 04:05 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/35863 (The current URI for this page, for reference purposes)
Salhi, Said: https://orcid.org/0000-0002-3384-5240
  • Depositors only (login required):

Downloads

Downloads per month over past year