Theory of Scheduling by Richard W. Conway

By:

Richard W. Conway [Author]

Contributor(s):

Publication details: Dover Publisher NewYork 2003Description: x, 294 pages; illustrations: 25 cmISBN:

9780486428178

DDC classification:

658.51

Summary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Book	Indian Institute of Management Visakhapatnam General Stacks	Non-fiction	658.51 CON (Browse shelf(Opens below))	Available		001103

Browsing Indian Institute of Management Visakhapatnam shelves, Shelving location: General Stacks, Collection: Non-fiction Close shelf browser (Hides shelf browser)

Previous								Next
Previous	658.421071 NEC Teaching entrepreneurship:	658.45 FAD The art of asking: ask better questions, get better answers	658.46 COS Case in Point 10: Complete Case Interview Preparation	658.51 CON Theory of Scheduling	658.52 VOR The Power of data storytelling /	658.53 BAK Principles of Sequencing and Scheduling	658.53 PIN Sheduling: Theory and algorithms and systems	Next

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.

There are no comments on this title.

to post a comment.