This book is a volume in the Penn Press Anniversary Collection. To mark its 125th anniversary in 2015, the University of Pennsylvania Press rereleased more than 1,100 titles from Penn Press's distinguished backlist from 1899-1999 that had fallen out of print. Spanning an entire century, the Anniversary Collection offers peer-reviewed scholarship in a wide range of subject areas.

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.

Most vols. include Proceedings of the Special Libraries Association.