Full Description
This book provides an in-depth presentation of algorithms for and complexity of open shop scheduling. Open shops allow operations of a job to be executed in any order, contrary to flow and job shops where the order is pre-specified. The author brings the field up to date with more emphasis on new and recent results, and connections with graph edge coloring and mathematical programming. The book explores applications to production and operations management, wireless network scheduling, and timetabling.
The book is addressed to researchers, graduate students, and practitioners in Operations Research, Operations Management, computer science and mathematics, who are developing and using mathematical approaches to applications in manufacturing, services and distributed wireless network scheduling.
Contents
Chapter 1: Preliminaries.- Chapter 2: Makespan minimization for two-machine open shops.- Chapter 3: General open shop scheduling.- Chapter 4: Multiprocessor operations.- Chapter 5: Concurrent open shops.- Chapter 6: Open shop scheduling with simultaneity constraints.- Chapter 7: Proportionate and ordered open shops.- Chapter 8: Multiprocessor open shops.- Chapter 9: Compact scheduling of open shops.- Chapter 10: No-wait open shop scheduling.- Chapter 11: Applications of preemptive open shop scheduling.- Chapter 12: Two-machine open shop scheduling with time lags.- Index.
