This book provides a theoretical and application oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. In such systems processors (machines) and possibly other resources are to be allocated among tasks in such a way that certain scheduling objectives are met. Various scheduling problems are discussed where different problem parameters such as task processing times, urgency weights, arrival times, deadlines, precedence constraints, and processor speed factor are involved. Polynomial and exponential time optimization algorithms as well as approximation and heuristic approaches (including tabu search, simulated annealing, genetic algorithms, and ejection chains) are presented and discussed. Moreover, resource-constrained, imprecise computation, flexible flow shop and dynamic job shop scheduling, as well as flexible manufacturing systems, are considered.

This book provides a theoretical and application-oriented analysis of deterministic scheduling problems in advanced planning and computer systems. The text examines 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. Discussion includes 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 will be useful to a broad audience, from researchers to practitioners, graduate and advanced undergraduate students.

This book provides a theoretical and application-oriented analysis of deterministic scheduling problems in advanced planning and computer systems. The text examines 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. Discussion includes 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 will be useful to a broad audience, from researchers to practitioners, graduate and advanced undergraduate students.

Written in a clear and concise manner this book provides a theoretical and application oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. Various scheduling problems are discussed where different problem parameters such as task processing times, urgency weights, arrival times, deadlines, precedence constraints, and processor speed factor are involved. Polynomial and exponential time optimization algorithms as well as approximation and heuristic approaches are presented and discussed. Moreover, resource-constrained, imprecise computation, flexible flow shop and dynamic job shop scheduling, as well as flexible manufacturing systems, are considered. An excellent analysis based on real-world applications with plenty of examples.

The central purpose of this book is to acquaint the reader especially with the cases of local search based learning as well as to introduce methods of constraint based reasoning, both with respect to their use in automated manufacturing. We restrict our attention to job shop scheduling as well as to one-machine scheduling with sequence dependent setup times. Additionally some design and planning issues in flexible manufacturing systems are considered. General purpose search methods which in particular include methods from local search such as simulated annealing, tabu search, and genetic algorithms, are the basic ingredients of the proposed intelligent knowledge-based scheduling systems, enriched by a number of constraint-based local decision rules in order to introduce problem specific knowledge.

Planen von Ablaufen ist zentraler Bestandteil unternehmerischen Handelns in Produktion, Logistik, Marketing und Personal oder von Anwendungen im Maschinenbau oder der Informatik. Ziel dieses Buches ist es, gangige Ablaufplanungsprobleme zu kategorisieren und fur diese Loesungsansatze zu prasentieren, so dass das in der Praxis vorhandene Verbesserungspotential erkennbar wird. Die theoretischen Grundlagen werden mit einfachen Beispielen erlautert, um schnell ein Verstandnis zu erzeugen. Zudem lehren diese Beispiele eine direkte erfolgreiche Bearbeitung der zahlreichen UEbungsaufgaben, so dass der Leser durch Erfolgserlebnisse weiter motiviert wird.