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
Journal of Scheduling
Solving the Response Time Variability Problem by means of metaheuristics
Proceedings of the 2006 conference on Artificial Intelligence Research and Development
Solving the Response Time Variability Problem by means of Multi-start and GRASP metaheuristics
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
| Hi-index | 0.00 |
The Multi-start metaheuristic has been applied straight or hybridized with other metaheuristics to solve a wide range of optimisation problems Moreover, this metaheuristic is very easy to be adapted and implemented for a wide variety of problems In this study, we propose a parametric multi-start algorithm that keeps its original simplicity To test the proposed algorithm, we solve the Response Time Variability Problem (RTVP) The RTVP is a NP-hard sequencing combinatorial optimisation problem that has recently defined 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 environment The RTVP occurs whenever products, clients or jobs need to be sequenced so as to minimise variability in the time between the instants at which they receive the necessary resources The computational experiment shows the robustness of the proposed multi-start technique.