You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This new edition of the well established text Scheduling - Theory, Algorithms, and Systems provides an up-to-date coverage of important theoretical models in the scheduling literature as well as significant scheduling problems that occur in the real world. It again includes supplementary material in the form of slide-shows from industry and movies that show implementations of scheduling systems. The main structure of the book as per previous edition consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing times and other problem data ar...
For over fifty years now, the famous problem of flow shop and job shop scheduling has been receiving the attention of researchers in operations research, engineering, and computer science. Over the past several years, there has been a spurt of interest in computational intelligence heuristics and metaheuristics for solving this problem. This book seeks to present a study of the state of the art in this field and also directions for future research.
First Published in 2005. Routledge is an imprint of Taylor & Francis, an informa company.
This text is written for the student who has no past experience in this area and is intended to support those who are undertaking training in organising schedules and negotiating and making appointments for senior personnel.
This book presents models and algorithms for complex scheduling problems. Besides resource-constrained project scheduling problems with applications also job-shop problems with flexible machines, transportation or limited buffers are discussed. Discrete optimization methods like linear and integer programming, constraint propagation techniques, shortest path and network flow algorithms, branch-and-bound methods, local search and genetic algorithms, and dynamic programming are presented. They are used in exact or heuristic procedures to solve the introduced complex scheduling problems. Furthermore, methods for calculating lower bounds are described. Most algorithms are formulated in detail and illustrated with examples. In this second edition some errors were corrected, some parts were explained in more detail, and new material has been added. In particular, further generalizations of the RCPSP, additional practical applications and some more algorithms were integrated.
The presence and use of real-time systems is becoming increasingly common. Examples of such systems range from nuclear reactors, to automotive controllers, and also entertainment software such as games and graphics animation. The growing importance of rea.
The ability of parallel computing to process large data sets and handle time-consuming operations has resulted in unprecedented advances in biological and scientific computing, modeling, and simulations. Exploring these recent developments, the Handbook of Parallel Computing: Models, Algorithms, and Applications provides comprehensive coverage on a
More than 80 percent of all projects start with underestimated schedules and costs, and are doomed to exceed projections. This concise book demonstrates how to establish realistic estimates, how to control a projects schedule and costs, and how to develop the projects plan and processes for successful project completion.
Master scheduling is an essential planning tool that helps manufacturers synchronize their production cycle with actual market demand. The third edition of this easy-to-follow handbook helps you understand the basic and more advanced concepts of master scheduling, from implementation to capacity planning to final assembly techniques. Packed with handy checklists and examples, Master Scheduling, Third Edition delivers guidelines and techniques for a world-class master schedule.
Besides scheduling problems for single and parallel machines and shop scheduling problems, the book covers advanced models involving due-dates, sequence dependent change-over times and batching. A discussion of multiprocessor task scheduling and problems with multi-purpose machines is accompanied by the methods used to solve such problems, such as polynomial algorithms, dynamic programming procedures, branch-and-bound algorithms and local search heuristics, and the whole is rounded off with an analysis of complexity issues.