A Book of Open Shop Scheduling: Algorithms, Complexity and Applications

This book provides an in-depth presentation of algorithms for and complexity of open shop scheduling, with an emphasis on new and recent results and connections with graph edge coloring and mathematical programming. It is addressed to researchers, graduate students, and practitioners in Operations Research, Operations Management, computer science, and mathematics.

Format: Paperback / softback
Length: 277 pages
Publication date: 05 January 2023
Publisher: Springer Nature Switzerland AG

This comprehensive book delves into the intricate realm of algorithms and complexity in open shop scheduling, a flexible approach where job operations can be executed in any order, unlike flow and job shops where the order is predetermined. The author, renowned for their expertise in the field, has updated the content with a greater focus on recent and groundbreaking results, as well as establishing connections with graph edge coloring and mathematical programming. The book explores a wide range of applications, including production and operations management, wireless network scheduling, and timetabling.

Designed for researchers, graduate students, and practitioners in Operations Research, Operations Management, computer science, and mathematics, this book offers valuable insights and practical applications for those developing and utilizing mathematical methodologies in manufacturing, services, and distributed wireless network scheduling.

The book begins by introducing the fundamental concepts and principles of open shop scheduling, including job types, processing times, and scheduling constraints. It then explores various algorithms and techniques for solving open shop scheduling problems, such as job sequencing, scheduling with precedence constraints, and dynamic programming approaches.

The author emphasizes the importance of considering the complexity of the scheduling problems and provides insights into how to analyze and optimize scheduling solutions. They discuss the use of heuristics, metaheuristics, and genetic algorithms to solve complex scheduling problems, and illustrate their effectiveness through case studies and real-world applications.

Furthermore, the book explores the connections between open shop scheduling and other areas of mathematics and computer science, such as graph theory, optimization, and mathematical programming. It discusses the use of graph models to represent scheduling problems and the application of optimization techniques to find optimal solutions.

The book concludes with a comprehensive review of the latest research and developments in open shop scheduling, including emerging trends, open-source software, and interdisciplinary collaborations. It provides a roadmap for future research and encourages practitioners to apply the latest algorithms and techniques to solve real-world scheduling problems.

In summary, this book is a valuable resource for researchers, graduate students, and practitioners seeking to advance their knowledge and expertise in open shop scheduling. It offers a comprehensive and up-to-date presentation of algorithms, complexity analysis, and applications, making it an essential tool for anyone working in the field.

Weight: 462g
Dimension: 235 x 155 (mm)
ISBN-13: 9783030910273
Edition number: 1st ed. 2022