Handbook of Scheduling: Algorithms, Models, and Performance Analysis

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.

ISBN 1584883979   Pages 1224 ISBN13 9781584883975 (What's this?)   Volumes 1 Publisher Taylor & Francis Ltd   Weight (grammes) 2222 Imprint Chapman & Hall/CRC   Published in Boca Raton Format Hardback   Series ISSN 01 Publication date 27 Apr 2004   Series title Chapman & Hall/CRC Computer & Information Science Series Non-book description 1 v. (various pagings) :   Height (mm) 254 Library of Congress 2004301869   Width (mm) 178 DEWEY 658.530151   Spine width (mm) 70 DEWEY edition DC22   Academic level Professional / Scholarly

Pt. I		Introduction
1		Introduction and notation by Joseph Y.-T. Leung
2		A tutorial on complexity by Joseph Y.-T. Leung
3		Some basic scheduling algorithms by Joseph Y.-T. Leung
Pt. II		Classical scheduling problems
4		Elimination rules for job-shop scheduling problem : overview and extensions by Jacques Carlier and Laurent Peridy and Eric Pinson and David Rivreau
5		Flexible hybrid flowshops by George Vairaktarakis
6		Open shop scheduling by Teofilo F. Gonzalez
7		Cycle shop scheduling by Vadim G. Timkovsky
8		Reducibility among scheduling classes by Vadim G. Timkovsky
9		Parallel scheduling for early completion by Bo Chen
10		Minimizing the maximum lateness by Hans Kellerer
11		Approximation algorithms for minimizing average weighted completion time by Chandra Chekuri and Sanjeev Khanna
12		Minimizing the number of tardy jobs by Marjan van den Akker and Han Hoogeveen
13		Branch-and-bound algorithms for total weighted tardiness by Antoine Jouglet and Philippe Baptiste and Jacques Carlier
14		Scheduling equal processing time jobs by Philippe Baptiste and Peter Brucker
15		Online scheduling by Kirk Pruhs and Jiri Sgall and Eric Torng
16		Convex quadratic relaxations in scheduling by Jay Sethuraman
Pt. III		Other scheduling models
17		The master-slave scheduling model by Sartaj Sahni and George Vairaktarakis
18		Scheduling in bluetooth networks by Yong Man Kim and Ten H. Lai
		More...

"More than 90 well-known authors in this area have made contributions to this handbook . This handbook is certainly valuable for researchers that want to get an impression on recent research areas and also an overview on existing results. [T]his handbook presents a huge volume of recent research in different scheduling areas, and certainly will stimulate further developments in many directions ." - Mathematical Reviews, Issue 2005d

 Be the first to write a customer review