Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s10951-006-0002-8 | J. Scheduling |
Keywords | Field | DocType |
Response time variability,Isochronous applications,Mixed-model assembly lines,Combinatorial optimisation,Heuristics | Bottleneck,Heuristic,Computational problem,Mathematical optimization,Computer science,Response time,Algorithm,Heuristics,Time complexity,Optimization problem,Computational complexity theory | Journal |
Volume | Issue | ISSN |
10 | 2 | 1094-6136 |
Citations | PageRank | References |
15 | 0.88 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| albert corominas subias | 1 | 139 | 17.56 |
| Wieslaw Kubiak | 2 | 540 | 62.61 |
| Natalia Moreno Palli | 3 | 15 | 0.88 |