Response time variability

Authors:
Albert Corominas;Wieslaw Kubiak;Natalia Moreno Palli
Affiliations:
Institute of Industrial and Control Engineering, Universitat Politècnica de Catalunya, Barcelona, Spain;Faculty of Business Administration, Memorial University of Newfoundland, St. John's, Canada;Faculty of Business Administration, Memorial University of Newfoundland, St. John's, Canada
Venue:
Journal of Scheduling
Year:
2007

Citing 0
Cited 9

Introducing dynamic diversity into a discrete particle swarm optimization

Computers and Operations Research
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
Note: Solving symmetric mixed-model multi-level just-in-time scheduling problems

Discrete Applied Mathematics
Solving the response time variability problem by means of a psychoclonal approach

Journal of Heuristics
Using aggregation to reduce response time variability in cyclic fair sequences

Journal of Scheduling
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
Using aggregation to construct periodic policies for routing jobs to parallel servers with deterministic service times

Journal of Scheduling
A branch and bound algorithm for the response time variability problem

Journal of Scheduling
Perfect periodic scheduling for three basic cycles

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Response time variability is a new optimization problem with a broad range of applications and a distinctive number of theoretic flavour. The problem occurs whenever events, jobs, clients or products need to be sequenced so as to minimize the variability of time for which they wait for the next turn in obtaining the resources necessary for their advance. The problem has numerous real-life applications. We study its computational complexity, present efficiency, polynomial time algorithms for some cases, and the NP-hardness proof for a general problem. We propose a position exchange heuristic and apply it to improve the total response time variability of an initial sequence. The latter is the optimum bottleneck sequence, Webster or Jefferson sequence of the apportionment, or a random sequence. We report on computational experiments with the heuristic.