Authors: John F. Raffensperger, Pascal Richard
Addresses: Department of Management, Private Bag 4800, University of Canterbury, Christchurch 8140, New Zealand. ' Laboratory of Applied Computer Science, LISI/ENSMA and University of Poitiers, Teleport 2 – BP 40109, Futuroscope 86961, France
Abstract: This article makes a modest step toward a quantitative measure of the work required to solve a specific kind of problem: a given spreadsheet design. The method relies on a measure that we define called constructive complexity, which is the number of keystrokes required to write a spreadsheet for a given computational task, as a function of the input data. The notion of constructive complexity is simple but general. The measure is simple enough to be described briefly in the classroom and the textbook. As an example, we use the shortest path problem. The objective is to educate operations research students and practitioners to write better spreadsheets, and to evaluate the quality of different spreadsheet designs. Constructive complexity could be used as a tool to achieve these objectives. We do not claim that it resolves all problems of spreadsheet design, but it is one step forward in quantifying spreadsheet design, and is intended to generate additional debate.
Keywords: computational analysis; decision support systems; DSS; constructive complexity; operations research; spreadsheet models; spreadsheet design; shortest path problem.
International Journal of Information and Operations Management Education, 2008 Vol.2 No.4, pp.388 - 406
Available online: 23 Feb 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article