Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 49, No. 6, November-December 2001, pp. 854-865
DOI: 10.1287/opre.49.6.854.10014
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Hall, N. G.
Right arrow Articles by Posner, M. E.
Right arrow Search for Related Content

Generating Experimental Data for Computational Testing with Machine Scheduling Applications

Nicholas G. Hall, Marc E. Posner

Fisher College of Business, Department of Management Sciences, The Ohio State University, Columbus, Ohio 43210-1399
Department of Industrial and Systems Engineering, The Ohio State University, Columbus, Ohio 43210-1271

hall.33{at}osu.edu
posner.1{at}osu.edu

The operations research literature provides little guidance about how data should be generated for the computational testing of algorithms or heuristic procedures. We discuss several widely used data generation schemes, and demonstrate that they may introduce biases into computational results. Moreover, such schemes are often not representative of the way data arises in practical situations. We address these deficiencies by describing several principles for data generation and several properties that are desirable in a generation scheme. This enables us to provide specific proposals for the generation of a variety of machine scheduling problems. We present a generation scheme for precedence constraints that achieves a target density which is uniform in the precedence constraint graph. We also present a generation scheme that explicitly considers the correlation of routings in a job shop. We identify several related issues that may influence the design of a data generation scheme. Finally, two case studies illustrate, for specific scheduling problems, how our proposals can be implemented to design a data generation scheme.

Subject classifications: Simulation, random variable generation: methods for generating random data; Production/scheduling: experimental data for testing algorithms and heuristics.
History: Received February 1997; revision received October 1998; revision received April 2000; accepted June 2000.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2001 by INFORMS.