Sequencing TheoryThe intent of these notes is to provide an appreciation of sequencing theory, and to develop an awareness of the combinatorial aspects of sequencing problems. An under standing of the ideas and concepts presented in these notes will provide the necessary background to enable further study in this rapidly growing subject. These notes have been used as a part of one-semester C0urses in Operations Research for both senior and first-year graduate students. Following the introductory chapter, several classes of scheduling models are discussed in Chapter 2. Chapter 3 is devoted to discussing the characteristics of several types of criteria that have been proposed in the literature. Because of the importance of the combinatorial properties in the analysis of scheduling models, various combinatorial aspects are treated in Chapter 4. The primary objective of such a treatment is to provide the reader with an insight into the nature of the problem. Due to the tremendous number of sequences involved, and the fact that many sequences have the same schedule time, statistical sampling has elicited a great deal of theoretical studies. Two such studies, one of which has evolved from my research, are reported in Chapter 5. Many references to basic sources are cited at the end of each chapter to provide a guide for further readings. I am indebted to Professor Santa Arora of the University of Minnesota who intro duced me to the subject during my graduate career. |
Other editions - View all
Common terms and phrases
active schedules CALIFORNIA LIBRARY combinatorial computational consider corresponding criterion decomposition solution direct-precedence relations distinct schedule evaluation feasible sequences flow-shop problem Gantt chart in-waiting inventory indicates job completion job due-dates job flow job-shop problems L-level chains linear graph lower bound machine changeover machine idle machine ordering matrix maximum mean flow mean number measure of performance minimum schedule node non-delay schedules non-feasible sequences normal distribution null matrix number of distinct number of feasible number of jobs number of machines number of possible number of potentially number of sequences operation 13 operational systems Operations Research opportunity cost particular job particular machine permutation sequences possible sequences potentially optimal sequences precedence relations precedes job procedure processing time matrix S₁ SAMPLE PROBABILITY sample problem schedulable operations scheduling problem Seiten semi-active schedules Sequencing Theory set of jobs set of schedulable single-machine subset increases tardiness three machines total number UNIVERSITY OF CALIFORNIA upper bound utilization