Theory of Scheduling 1st Edition by Richard W Conway ISBN 9780486428178 by Richard W. Conway, William L. Maxwell, Louis W. Miller 0486428176 instant download after payment.

Theory of Scheduling 1st Edition by Richard W Conway - Ebook PDF Instant Download/Delivery: 9780486428178
Full download Theory of Scheduling 1st Edition after payment

Product details:

ISBN 13: 9780486428178
Author: Richard W Conway

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 investigation of the continuous job-shop process. 1967 edition.

Theory of Scheduling 1st Table of contents:

CHAPTER 1 - PROBLEMS OF SEQUENCE
1—1 QUESTIONS OF “PURE” SEQUENCE
1—2 THE JOB-SHOP PROCESS
1—3 A CLASSIFICATION OF SCHEDULING PROBLEMS
CHAPTER 2 - MEASURES FOR SCHEDULE EVALUATION
2—1 VARIABLES THAT DEFINE A SCHEDULING PROBLEM
2—2 VARIABLES THAT DESCRIBE THE SOLUTION TO A SCHEDULING PROBLEM
2—3 PERFORMANCE MEASURES FOR THE SHOP
2—4 THE RELATIONSHIP BETWEEN FLOW-TIME AND INVENTORY
2—5 COSTS ASSOCIATED WITH SCHEDULING DECISIONS
CHAPTER 3 - FINITE SEQUENCING FOR A SINGLE MACHINE
3_1 PERMUTATION SCHEDULES
3—2 SEQUENCING ACCORDING TO PROCESSING-TIME
3—3 SEQUENCING ACCORDING TO DUE-DATE
3—4 RANDOM SEQUENCING
3—5 PROPERTIES OF ANTITHETICAL RULES
3—6 SPT SEQUENCING WITH INCOMPLETE INFORMATION
3—7 SEQUENCING AGAINST WEIGHTED MEASURES OF PERFORMANCE
3—8 SEQUENCING WITH MULTIPLE CLASSES
CHAPTER 4 - FURTHER PROBLEMS WITH ONE OPERATION PER JOB
4—1 SEQUENCE-DEPENDENT SETUP-TIMES
4—2 INTERMITTENT JOB ARRIVALS
4—3 REQUIRED PRECEDENCE AMONG JOBS
4—4 PARALLEL MACHINES
CHAPTER 5 - FLOW-SHOP SCHEDULING
5—1 PERMUTATION SCHEDULES
5—2 MINIMIZING MAXIMUM FLOW-TIME IN A TWO-MACHINE FLOW-SHOP (n/2/F/Fmax)
5—3 MINIMIZING MEAN FLOW-TIME IN A TWO-MACHINE FLOW-SHOP
5—4 THE THREE-MACHINE FLOW-SHOP (n/3/F/Fmax)
5—5 SEQUENCING IN LARGE FLOW-SHOPS
CHAPTER 6 - THE GENERAL n/m JOB-SHOP PROBLEM
6—1 A GRAPHICAL DESCRIPTION OF THE PROBLEM
6_2 THE TWO-MACHINE JOB-SHOP PROBLEM
6_3 THE TWO-JOB JOB-SHOP PROBLEM
6-4 INTEGER PROGRAMMING FORMULATION OF THE JOB-SHOP PROBLEM
6-5 TYPES OF SCHEDULES
6-6 GENERATION OF SCHEDULES
6—7 BRANCH-AND-BOUND APPROACH TO THE JOB-SHOP PROBLEM
6—8 EXAMPLES OF SCHEDULE GENERATION
6—9 PROBABILISTIC DISPATCHING
6—10 HEURISTIC PROCEDURES
CHAPTER 7 - GENERAL NETWORK PROBLEMS RELATED TO SCHEDULING
7–1 CRITICAL ROUTE ANALYSIS
7–2 SHORTEST-ROUTE DETERMINATION
7–3 ASSEMBLY-LINE BALANCING PROBLEMS
CHAPTER 8 - SELECTION DISCIPLINES IN A SINGLE-SERVER QUEUING SYSTEM
8–1 QUEUES WITH POISSON ARRIVALS
8–2 SYSTEM STATES
8–3 THE BUSY PERIOD OF A QUEUE WITH POISSON ARRIVALS
8–4 THE DISTRIBUTION OF FLOW-TIME UNDER THE FIRST-COME, FIRST-SERVED DISCIPLINE
8-5 SELECTION DISCIPLINES THAT ARE INDEPENDENT OF PROCESSING-TIMES
8-6 NONPREEMPTIVE PRIORITY AND SHORTEST-PROCESSING-TIME DISCIPLINES
8-7 PREEMPTIVE PRIORITY DISCIPLINES
8-8 THE DUE-DATE RULE AND RELATED DISCIPLINES
8-9 THE EFFECT OF PROCESSING-TIME-DEPENDENT DISCIPLINES ON FLOW-TIME
8-10 HISTORICAL NOTES
CHAPTER 9 - SINGLE-SERVER QUEUING SYSTEMS WITH SETUP CLASSES
9-1 PREEMPTIVE RESUME PRIORITIES WITH PREEMPTIVE REPEAT SETUP-TIMES FOR EACH JOB
9-2 ALTERNATING-PRIORITY DISCIPLINE WITHOUT SETUP-TIME
9-3 FIRST-COME, FIRST-SERVED WITH SETUP CLASSES
9-4 ALTERNATING-PRIORITY DISCIPLINES WITH SETUP-TIMES
CHAPTER 10 - MULTIPLE-SERVER QUEUING MODELS
10–1 STATE-DEPENDENT COMPLETION RATES; MULTIPLE-CHANNEL QUEUES
10–2 THE OUTPUT OF A POISSON-EXPONENTIAL QUEUING SYSTEM
10–3 QUEUES IN SERIES
10–4 GENERAL QUEUE NETWORKS
CHAPTER 11 - EXPERIMENTAL INVESTIGATION OF THE CONTINUOUS JOB-SHOP PROCESS
11–1 EXPERIMENTAL CONDITIONS AND PROCEDURES
11–2 REDUCTION OF MEAN QUEUE LENGTH AND WORK-IN-PROCESS INVENTORY
11-3 SEQUENCING AGAINST DUE-DATES
11—4 INVESTIGATIONS OF MORE COMPLEX JOB-SHOP MODELS
BIBLIOGRAPHY
APPENDIX A - THE LAPLACE-STIELTJES TRANSFORM OF A DISTRIBUTION FUNCTION
APPENDIX B - EXPERIMENTAL RESULTS: n/m JOB-SHOP PROBLEM
APPENDIX C - EXPERIMENTAL RESULTS: CONTINUOUS-PROCESS JOB-SHOP PROBLEM
INDEX

People also search for Theory of Scheduling 1st:

Tags: Richard W Conway, Theory, Scheduling