This book provides a theoretical and application-oriented analysis of deterministic scheduling problems arising in advanced planning and computer systems. The text examines specific scheduling problems across a range of parameters: job priority, release times, due dates, processing times, precedence constraints, resource usage and more, focusing on such topics as computer systems and supply chain management. Analysis and solutions are presented through polynomial and exponential time optimization algorithms as well as approximation and heuristic approaches. The book explores a variety of problems including single and parallel processors, flexible shops and manufacturing systems, and resource-constrained project scheduling.

Many applications from industry and service operations management and case studies are described. The handbook is an indispensable source for a broad audience, ranging from researchers to practitioners, graduate and advanced undergraduate students.

From the Back Cover:

This handbook covers not only in a unified approach the most important scheduling models and methods, it also put special emphasis to their relevance to practical situations. Many applications from industry and service operations management and case studies are described. Because the book offers some preliminaries concerning basic notions from discrete mathematics, it can also be used by beginners. As a consequence, the handbook is an indispensable source for a broad audience, ranging from researchers to practitioners, graduate and advanced undergraduate students in computer science/engineering, operations research, industrial and real-time engineering, management science, business administration, information systems, and applied mathematics curricula.

"About this title" may belong to another edition of this title.

Store Description

collection of few very good books

Visit Seller's Storefront