Skip to content

Theory of Scheduling

Best in textbook rentals since 2012!

ISBN-10: 0486428176

ISBN-13: 9780486428178

Edition: 2003

Authors: Richard W. Conway, William L. Maxwell, Louis W. Miller

List price: $22.95
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


This comprehensive text explores the mathematical models underlying the theory of scheduling. Organized according to scheduling problem type, it examines three solution techniques: algebraic, probabilistic, and Monte Carlo simulation by computer. Topics include problems of sequence, measures for schedule evaluation, finite sequencing for a single machine, and further problems with one operation per job. Additional chapters cover flow-shop scheduling, the general n/m job-shop problem, general network problems related to scheduling, selection disciplines in a single-server queuing system, single-server queuing systems with setup classes, multiple-server queuing models, and experimental…    
Customers also bought

Book details

List price: $22.95
Copyright year: 2003
Publisher: Dover Publications, Incorporated
Publication date: 6/9/2003
Binding: Paperback
Pages: 304
Size: 6.14" wide x 8.90" long x 0.59" tall
Weight: 0.880
Language: English

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