Jeffrey W. Herrmann
Jane L. Snowdon
In the last four decades, scheduling problems have received much attention by researchers. Recently, the Just-in-Time concept has inspired a renewed interest in scheduling, especially among industry practitioners. Although a number of papers have reviewed this field, this paper presents an easy-to-use reference guide of static scheduling problems with complexity results for practitioners, students, and others. Every attempt has been made to be complete; however, this survey is not exhaustive. This paper includes both regular and non-regular measures of performance, separate sections on dual criteria and multicriteria problems, and a discussion of recent developments in heuristic search approaches to these problems.
Download: Click on the following link to download the paper, which is in three parts. Each file is in PDF format.
Bibliographic Information: Herrmann, J.W., C.-Y. Lee, and J.L. Snowdon, A classification of static scheduling problems, in Complexity in Numerical Optimization, P.M. Pardalos, ed., pp. 203-253, World Scientific Publishing Co., Singapore, 1993.
Copyright Notice: This paper appears in Complexity in Numerical Optimization, published by World Scientific Publishing Co., which owns the copyright to this material. Personal use of this material is permitted. However, permission to reprint or republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists or to reuse any copyrighted component of this work in other works must be obtained from the copyright holder.
Last updated by Jeffrey W. Herrmann, February 23, 2005.
Return to Jeffrey W. Herrmann | University of Maryland | Department of Mechanical Engineering | Institute for Systems Research | Computer Integrated Manufacturing Lab .