Solving the Response Time Variability Problem by means of Multi-start and GRASP metaheuristics

Authors:
Albert Corominas;Alberto García-Villoria;Rafael Pastor
Affiliations:
Institute of Industrial and Control Engineering (IOC), Technical University of Catalonia (UPC), Barcelona, Spain;Institute of Industrial and Control Engineering (IOC), Technical University of Catalonia (UPC), Barcelona, Spain;Institute of Industrial and Control Engineering (IOC), Technical University of Catalonia (UPC), Barcelona, Spain
Venue:
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Year:
2008

Citing 9
Cited 2

Level schedules for mixed-model assembly lines in just-in-time production systems

Management Science
The scheduling of maintenance service

Discrete Applied Mathematics
Time Slot Allocation for Real-Time Messages with Negotiable Distance Constrains

RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
Stride Scheduling: Deterministic Proportional- Share Resource Management

Stride Scheduling: Deterministic Proportional- Share Resource Management
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Response time variability

Journal of Scheduling
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search

Operations Research
Introducing dynamic diversity into a discrete particle swarm optimization

Computers and Operations Research
Solving the Response Time Variability Problem by means of metaheuristics

Proceedings of the 2006 conference on Artificial Intelligence Research and Development

A parametric multi-start algorithm for solving the response time variability problem

LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
A branch and bound algorithm for the response time variability problem

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Response Time Variability Problem (RTVP) is an NP-hard scheduling optimization problem that has recently appeared in the literature. This problem has a wide range of real-life applications in, for example, manufacturing, hard real-time systems, operating systems and network environments. The RTVP occurs whenever models, clients or jobs need to be sequenced to minimize variability in the time between the instants at which they receive the necessary resources. The RTVP has been already solved in the literature with a multi-start and a GRASP algorithm. We propose an improved multi-start and an improved GRASP algorithm to solve the RTVP. The computational experiment shows that, on average, the results obtained with our proposed algorithms improve on the best obtained results to date.