Grid Resource Management: State of the Art and Future Trends presents an overview of the state of the field and describes both the real experiences and the current research available today. Grid computing is a rapidly developing and changing field, involving the shared and coordinated use of dynamic, multi-institutional resources. Grid resource management is the process of identifying requirements, matching resources to applications, allocating those resources, and scheduling and monitoring Grid resources over time in order to run Grid applications as efficiently as possible.
While Grids have become almost commonplace, the use of good Grid resource management tools is far from ubiquitous because of the many open issues of the field, including the multiple layers of schedulers, the lack of control over resources, the fact that resources are shared, and that users and administrators have conflicting performance goals. These are the issues addressed in this book, in addition to elucidating the overlap with related areas including discussions of work with peer-to-peer computing, economic approaches, and operations research.
Grid Resource Management: State of the Art and Future Trends is an invaluable resource for today's user, application developer, or resource owners when working with Grid resource management systems.

The problem of allocating scarce resources over time to perform a given set of activities - that is, project scheduling - appears in the vast spectrum of real-world situations. Over the last forty years project scheduling problems have been carefully studied, resulting in a considerable body of knowledge. Recently, however, the power and ubiquity of the computer has had a pronounced effect on research in project scheduling and project scheduling models. As a result, considerable progress has been made in all directions of modeling and finding solutions to these problems. This volume is a state-of-the-art treatment of Project Scheduling in general and of recent developments in particular. Part I deals with classical models. By classical model' we mean the deterministic problems involving discrete resources only and the evaluation of schedules on the basis of a single criterion. This term covers a wide variety of problems, including (discrete) resource-duration interaction, i.e. multi-mode models. Part 2 deals with heuristic algorithms for these models. It is complemented by chapters treating such important problems as benchmark instances, interval capacity consistency tests, and the evolution of software quality for (classical) project scheduling problems. In Part 3 the most important new or non-classical' models are considered. These include probabilistic and fuzzy models, and continuous resources as well as multi-criteria formulations and knowledge-based systems. Part 4 contains some important extensions and/or applications of the project scheduling problems considered in the previous chapters.

Operations Research began as a field with the mathematical scheduling of a massive projecta "logistically supplying Europe with military equipment and goods during the 2nd World War. Today project scheduling research continues to grow in the variety of its theoretical models, in its magnitude, and in its application. As the world becomes more interrelated and complex, the wider its research is applied to an increasing number of project scheduling problems.

The book surveys the current state-of-the-art in this realm of operations research with chapters written by the respective leading experts on each topic. It will cover the range of the key models in the field, including deterministic, probabilistic, single- and multi-mode, single- and multi-objective, and a general model on discrete-continuous resources. Recent solution algorithms are systematically examined. The book summarizes the current developments and theoretical achievements in the field. These new developments include project uncertainty and grid resource management.

PERSPECTIVES IN MODERN PROJECT SCHEDULING systematically presents this dynamically developing area in three parts. Part I discusses new models of the project management process that are being developed. They include an alternative to the well-known PERT technique, consideration of disturbances during the project realization, introduction of new constraints like due dates or setup times, as well as a general discussion on classification of resources.

Part II outlines and evaluates the new algorithms that have been developed to solve the strongly NP-hard resource constrained project scheduling efficiently with acceptable accuracy. New lowerbounds for the RCPSP are proposed, followed by smart justification technique and a series of Metaheuristics. Finally, a neural network approach is introduced.

Part III is devoted to new areas of applications of the project management models and the algorithms a" for example, pharmaceutical research, grid computing, factory pick-up of new cars, batch scheduling in process industries and make-to-order (project driven) manufacturing a" that have been developed to solve project scheduling problems in these application areas.

The book will be of interest to academics and students in project management and scheduling in Business Schools, Operations Research/Management Science, Computer Science & Engineering, Systems Analysis, and Applied Mathematics. In addition, decision makers, consultants and practitioners in industry, government and service organizations will also be interested in this book.

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 will focus on new Remote Instrumentation aspects related to middleware architecture, high-speed networking, wireless Grid for acquisition devices and sensor networks, QoS provisioning for real-time control, measurement instrumentation and methodology. Moreover, it will provide knowledge about the automation of mechanisms oriented to accompanying processes that are usually performed by a human. Another important point of this book is focusing on the future trends concerning Remote Instrumentation systems development and actions related to standardization of remote instrumentation mechanisms.

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.

This book will focus on new Remote Instrumentation aspects related to middleware architecture, high-speed networking, wireless Grid for acquisition devices and sensor networks, QoS provisioning for real-time control, measurement instrumentation and methodology. Moreover, it will provide knowledge about the automation of mechanisms oriented to accompanying processes that are usually performed by a human. Another important point of this book is focusing on the future trends concerning Remote Instrumentation systems development and actions related to standardization of remote instrumentation mechanisms."

Project scheduling problems are, generally speaking, the problems of allocating scarce resources over time to perform a given set of activities. The resources are nothing other than the arbitrary means which activities complete for. Also the activities can have a variety of interpretations. Thus, project scheduling problems appear in a large spectrum of real-world situations, and, in consequence, they have been intensively studied for almost fourty years. Almost a decade has passed since the multi-author monograph: R. Slowinski, 1. W~glarz (eds. ), Advances in Project Scheduling, Elsevier, 1989, summarizing the state-of-the-art across project scheduling problems, was published. Since then, considerable progress has been made in all directions of modelling and finding solutions to these problems. Thus, the proposal by Professor Frederick S. Hillier to edit a handbook which reports on the recent advances in the field came at an exceptionally good time and motivated me to accept the challenge. Fortunately, almost all leading experts in the field have accepted my invitation and presented their completely new advances often combined with expository surveys. Thanks to them, the handbook stands a good chance of becoming a key reference point on the current state-of-the-art in project scheduling, as well as on new directions in the area. The contents are divided into four parts. The first one, dealing with classical models -exact algorithms, is preceded by a proposition of the classification scheme for scheduling problems.

Grid Resource Management: State of the Art and Future Trends presents an overview of the state of the field and describes both the real experiences and the current research available today. Grid computing is a rapidly developing and changing field, involving the shared and coordinated use of dynamic, multi-institutional resources. Grid resource management is the process of identifying requirements, matching resources to applications, allocating those resources, and scheduling and monitoring Grid resources over time in order to run Grid applications as efficiently as possible. While Grids have become almost commonplace, the use of good Grid resource management tools is far from ubiquitous because of the many open issues of the field, including the multiple layers of schedulers, the lack of control over resources, the fact that resources are shared, and that users and administrators have conflicting performance goals.

A theoretical and application-oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. The important classical results are surveyed with particular attention paid to single-processor scheduling, along with general models such as resource-constrained scheduling, flexible flow shops, dynamic job shops, and special flexible manufacturing systems. Polynomial and exponential-time optimization algorithms as well as approximation and heuristic ones are presented using a Pascal-like notation, before being discussed in the light of particular problems. Basic concepts from scheduling theory and related fields are described to assist less advanced readers.

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 surveys the current state-of-the-art in operations research. The book summarizes the current developments and theoretical achievements in the field, including project uncertainty and grid resource management. It further covers the range of the key models in the field, including deterministic, probabilistic, single- and multi-mode, single- and multi-objective, and a general model on discrete-continuous resources.

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.