Search

This book explores scheduling problems in advanced planning and computer systems. The text examines a range of parameters: job priority, release times, due dates, processing times, resource usage and more, focusing on such aspects as computer systems and supply chain management.

This book is the result of a joint Gennan-Polish project which has been partially sup ported by the Committee for Scientific Research 1 and the Deutsche Forschungsge meinschaft2. We appreciate the help of both institutions. The planning and preparation of the manuscript was an iterative and rather lengthy process which we had to stop at a certain stage, but it does not mean that we were fully satisfied with the output. Thus, comments and improvements will be appreciated. In the meantime we would like to thank many colleagues who already discussed with us different topics presented in the book. We are not able to list all of them but we would like to express our special gratitude toward Peter Brucker, Gerd Finke, Adam Janiak, Wieslaw Kubiak, Kathryn Stecke, and Dominique de Werra. As to the technical help in preparing the manuscript our thanks are due to Barbara Blarewicz, Brigitte Ecker, Maria Kaminska, and Brigitte Sand, especially for their typing efforts.

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.

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 is a continuation of Scheduling in Computer and Manufacturing Sys tems 1, two editions of which have received kind acceptance of a wide readership. As the previous position, it is the result of a collaborative German-Polish project which has been partially supported by Committee for Scientific Research 2 and DFG. We appreciate this help. We decided to treat this work as a new book rather than the third edition of the previous one due to two important reasons. First of all, the contents has been changed significantly. This concerns not only corrections we have introduced following the suggestions made by many readers (we are very grateful to all of them!) and taking into account our own experience, but first of all this means that important new material has been added. In particular, in the introductory part the ideas of new local search heuristics, i. e. generally applicable global optimization strategies with a simple capability of learning (ejection chains, genetic algo rithms) have been presented. In the framework of parallel processor scheduling, topics of imprecise computations and lot size scheduling have been studied. Further on flow shop and job shop scheduling problems have been studied much more extensively, both from the viewpoint of exact algorithms as well as heuris tics.

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.

This book is a continuation of Scheduling in Computer and Manufacturing Sys tems 1, two editions of which have received kind acceptance of a wide readership. As the previous position, it is the result of a collaborative German-Polish project which has been partially supported by Committee for Scientific Research 2 and DFG. We appreciate this help. We decided to treat this work as a new book rather than the third edition of the previous one due to two important reasons. First of all, the contents has been changed significantly. This concerns not only corrections we have introduced following the suggestions made by many readers (we are very grateful to all of them!) and taking into account our own experience, but first of all this means that important new material has been added. In particular, in the introductory part the ideas of new local search heuristics, i. e. generally applicable global optimization strategies with a simple capability of learning (ejection chains, genetic algo rithms) have been presented. In the framework of parallel processor scheduling, topics of imprecise computations and lot size scheduling have been studied. Further on flow shop and job shop scheduling problems have been studied much more extensively, both from the viewpoint of exact algorithms as well as heuris tics.