Sensitivity analysis of scheduling algorithms

European Journal of Operational Research

Volumn 134, Issue 3, 2001, Pages 606-615

  Penz, B ^a   Rapine, C ^a   Trystram, D ^b  

^a INP Grenoble ENSGI   (France)

^b ZIRST   (France)

Author keywords

Independent tasks; Makespan and flowtime criteria; On line disturbances; Performance guarantee; Scheduling; Sensitivity analysis

Indexed keywords

ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PERTURBATION TECHNIQUES; SENSITIVITY ANALYSIS;

ONLINE DISTURBANCES;

SCHEDULING;

EID: 0035501911     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00281-2     Document Type: Article

References (14)

1. A priori optimization
2. Applications of graph scheduling techniques in parallelizing irregular scientific computation
3. Bounds on multiprocessing timing anomalies
4. Optimization and approximation in deterministic sequencing and scheduling: A survey
5. Inherently stable real-time priority list dispatchers
6. Sequencing and scheduling: Algorithms and complexity
7. Production and stabilization of real-time task schedules
8. Scheduling with communication delays and on-line disturbances
9. Analysis and evaluation of heuristic methods for static task scheduling