Handbook of Scheduling

Provides full coverage of the most recent advances in scheduling, gathering authors and topics from across the fields of management, industrial engineering, operations research, and computer science Examines job shop, flow shop, open shop, and cycle shop problemsCovers five major objective functions in classical scheduling theory: makespan, maximum lateness, total weighted completion time, total weighted number of late jobs, and total weighted tardinessReviews analysis of the coordination ratio, which is the ratio of the worst possible Nash equilibrium and the overall optimumIntroduces constraint programming (CP) and a new vehicle routing heuristic known as Very Large Scale Neighborhood SearchDiscusses batch scheduling problems in the process industry in which time-based objective functions are minimized 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.