Handbook of Scheduling: Algorithms, Models, and Performance Analysis: 01 (Chapman & Hall/CRC Computer and Information Science Series)

. Ed(s): Leung, Joseph Y.T.

ISBN 10: 1584883979 / ISBN 13: 9781584883975

Published by Chapman and Hall/CRC, 2004

About this Item

Covers advanced topics in scheduling, assembling researchers from various relevant disciplines to facilitate fresh insights. This title provides introductory material, with tutorials and algorithms, and examines classical scheduling problems. It explores scheduling models that originate in areas such as computer science and operations research. Editor(s): Leung, Joseph Y.T. Series: Chapman & Hall/CRC Computer & Information Science Series. Num Pages: 1224 pages, 262 black & white illustrations, 70 black & white tables. BIC Classification: KJMV5. Category: (P) Professional & Vocational. Dimension: 264 x 187 x 70. Weight in Grams: 2222. . 2004. 1st Edition. hardcover. . . . .

Seller Inventory # V9781584883975

Bibliographic Details

• Title: Handbook of Scheduling: Algorithms, Models, and Performance Analysis: 01 (Chapman & Hall/CRC Computer and Information Science Series)
• Publisher: Chapman and Hall/CRC
• Publication Date: 2004
• Language: English
• ISBN 10: 1584883979
• ISBN 13: 9781584883975
• Binding: Hardcover
• Edition: 1st Edition
• Condition: New

About this title

Synopsis

Researchers in management, industrial engineering, operations, and computer science have intensely studied scheduling for more than 50 years, resulting in an astounding body of knowledge in this field. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, the first handbook on scheduling, provides full coverage of the most recent and advanced topics on the subject. It assembles researchers from all relevant disciplines in order to facilitate cross-fertilization and create new scheduling insights.

The book comprises six major parts, each of which breaks down into smaller chapters:

· Part I introduces materials and notation, with tutorials on complexity theory and algorithms for the minimization of makespan, total completion time, dual objectives, maximum lateness, the number of late jobs, and total tardiness.

· Part II is devoted to classical scheduling problems.

· Part III explores scheduling models that originate in computer science, operations research, and management science.

· Part IV examines scheduling problems that arise in real-time systems, focusing on meeting hard deadline constraints while maximizing machine utilization.

· Part V discusses stochastic scheduling and queueing networks, highlighting jobs that are not deterministic.

· Part VI covers applications, discussing scheduling problems in airline, process, and transportation industries, as well as in hospitals and educational institutions.

About the Author

Joseph Y-T. Leung