Simulated Versus Real Life Data in Testing the Efficiency of Scheduling Algorithms
- 1 March 1986
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 18 (1) , 16-25
- https://doi.org/10.1080/07408178608975325
Abstract
This paper compares and contrasts the use of simulated versus real data in testing the efficiency of scheduling algorithms. Five hypotheses, formulated to evaluate two important measures of algorithm efficiency, viz., CPU time and the number of iterations, are tested on over one hundred problems drawn from different sources. On the basis of these empirical results, it is shown that: (1) the real problems are easier to solve than the simulated ones; and (2) the Natural Order heuristic is more effective on real problems than simulated ones. Implications of these results for testing the efficiency of algorithms are discussed.Keywords
This publication has 4 references indexed in Scilit:
- An Empirical Evaluation of the “Entrapment” Procedure for Scheduling Jobs on Identical MachinesIIE Transactions, 1983
- An Improved Algorithm for Scheduling Jobs on Identical MachinesA I I E Transactions, 1977
- Scheduling Jobs on a Number of Identical MachinesA I I E Transactions, 1974
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959