This comprehensive text explores the mathematical models underlying the theory of scheduling. Organized according to scheduling problem type, it examines 3 solution techniques: algebraic, probabilistic, and Monte Carlo simulation by computer. 1967 edition.and#160;
Chapter 1
and#160; Problems of Sequence
and#160; 1-1 "Questions of "pure" sequence"
and#160; 1-2 The job-shop process
and#160; 1-3 A classification of scheduling probems
Chapter 2
and#160; Measures for Schedule Evaluation
and#160; 2-1 Variables that define a scheduling problem
and#160; 2-2 Variables that describe the solution to a scheduling problem
and#160; 2-3 Performance measures for the shop
and#160; 2-4 The relationship between flow-time and inventory
and#160; 2-5 Costs associated with scheudling decisions
Chapter 3
and#160; Finite Sequencing for a Single Machine
and#160; 3-1 Permutation schedules
and#160; 3-2 Sequencing according to processing-time
and#160; 3-3 Sequencing according to due date
and#160; 3-4 Random sequencing
and#160; 3-5 Properties of antithetical rules
and#160; 3-6 SPT sequencing with incomplete information
and#160; 3-7 Sequencing against weighted measures of performance
and#160; 3-8 Sequencing with multiple classes
Chapter 4
and#160; Further Problems with One Operation per Job
and#160; 4-1 Sequence-dependent setup-times
and#160;and#160;and#160; 4-1.1 "A "branch-and-bound" algorithm for the traveling-salesman problem"
and#160;and#160;and#160; 4-1.2 Solution of the traveling-salesman problem by dynamic programming
and#160;and#160;and#160; 4-1.3 "The "closest-unvisited-city" algorithm for the traveling-salesman problem"
and#160; 4-2 Intermittent job arrivals
and#160; 4-3 Required precedence among jobs
and#160;and#160;and#160; 4-3.1 Required strings of jobs
and#160;and#160;and#160; 4-3.2 General precedence constraints
and#160; 4-4 Parallel machines
Chapter 5
and#160; Flow-Shop Scheduling
and#160; 5-1 Permutation schedules
and#160; 5-2 Minimizing maximum flow-time in a two-machine flow-shop
and#160; 5-3 Minimizing mean flow-time in a two-machine flow-shop
and#160; 5-4 The three-machine flow shop
and#160; 5-5 Sequencing in large flow-shops
Chapter 6
and#160; The General n/m Job-Shop Problem
and#160; 6-1 A graphical description of the problem
and#160; 6-2 The two-machine job-shop problem
and#160; 6-3 The two-job job-shop problem
and#160; 6-4 Integer programming formulation of the job-shop problem
and#160; 6-5 Types of schedules
and#160; 6-6 Generation of schedules
and#160; 6-7 Branch-and-bound approach to the job-shop problem
and#160; 6-8 Examples of schedule generation
and#160; 6-9 Probabilistic dispatching
and#160; 6-10 Heuristic procedures
Chapter 7
and#160; General Network Problems Related to Scheduling
and#160; 7-1 Critical route analysis
and#160; 7-2 Shortest route determination
and#160; 7-3 Assembly-line balancing problems
Chapter 8
and#160; Selection Disciplines in a Single-Server Queuing System
and#160; 8-1 Queues with Poisson arrivals
and#160; 8-2 System states
and#160; 8-3 The busy period of a queue with Poisson arrivals
and#160; 8-4 "The distribution of flow-time under the first-come, first-served discipline"
and#160; 8-5 Selection disciplines that are independent of processing-times
and#160;and#160;and#160; 8-5.1 Distribution of number of jobs in the system
and#160;and#160;and#160; 8-5.2 "The last-come, first-served discipline"
and#160;and#160;and#160; 8-5.3 The random rule
and#160; 8-6 Nonpreemptive priority and shortest-processing-time disciplines
and#160;and#160;and#160; 8-6.1 Nonpreemptive priority disciplines
and#160;and#160;and#160; 8-6.2 The shortest-processing-time discipline
and#160;and#160;and#160; 8-6.3 Multiple-level nonpreemptive-priority disciplines
and#160; 8-7 Preemptive priortity disciplines
and#160;and#160;and#160; 8-7.1 Preemptive-resume and preemptive-repeat disciplines
and#160;and#160;and#160; 8-7.2 Semi-preemptive priority and shortest-remaining-processing-time disciplines
and#160; 8-8 The due-date rule and related disciplines
and#160; 8-9 The effect of processing-time-dependent disciplines on flow-time
and#160; 8-10 Historical notes
Chapter 9
and#160; Single-Server Queuing Systems with Setup Classes
and#160; 9-1 Preemptive-resume priorities with preemptive-repeat setup-times for each job
and#160; 9-2 Alternating priority discipline without setup-time
and#160; 9-3 "First-come, first-served with setup classes"
and#160; 9-4 Alternating priority disciplines with setup-time
Chapter 10
and#160; Multiple-Server Queuing Models
and#160; 10-1 State-dependent completion rates; multiple-channel queues
and#160; 10-2 The output of a Poisson-exponential queuing system
and#160; 10-3 Queues in series
and#160; 10-4 General queue networks
Chapter 11
and#160; Experimental Investigation of the Continuous Job-Shop Process
and#160; 11-1 Experimental conditions and procedures
and#160; 11-2 The reduction of mean queue length and work-in-process inventory
and#160;and#160;and#160; 11-2.1 Truncation of the shortest-processing-time rule
and#160;and#160;and#160; 11-2.2 SPT sequencing with multiple classes
and#160;and#160;and#160; 11-2.3 SPT sequencing with incomplete information
and#160; 11-3 Sequencing against due-dates
and#160;and#160;and#160; 11-3.1 Assignment of due-dates
and#160;and#160;and#160; 11-3.2 A state-dependent due-date procedure
and#160; 11-4 Investigations of more complex job-shop models
and#160;and#160;and#160; 11-4.1 Flexibility in machine selection
and#160;and#160;and#160; 11-4.2 Flexibility in operation sequence
and#160;and#160;and#160; 11-4.3 Sequencing in an assembly shop
Bibliography
Appendix A
and#160; The Laplace-Stieltjes Transform of a Distribution Function
Appendix B
and#160; Experimental Results: n/m Job-Shop Problem
and#160; B-1 Mean flow-time
and#160; B-2 Maximum flow-time
and#160; B-3 Mean machine finish-time
Appendix C
and#160; Experimental Results: Continuous-Process Job-Shop Problem
and#160; C-1 Notation used in priority rules
and#160; C-2 Definition of priority rules for the RAND study
and#160; C-3 "Experimental investigation of priority assignment in a simple, symmetric, random-routed job-shop of 9 machines"
and#160; C-4 "Experimental results for a state-dependent due-date procedure in a simple, symmetric, random-routed job-shop of 8 machines"
and#160; C-5 Flexibility in machine selection in a symmetric random-routed job-shop of 9 machines
and#160; C-6 Flexibility in operation sequence in a symmetric random-routed job-shop of 9 machines
and#160; C-7 Sequencing in an assembly shop
Index