To purchase hard copies of this book, please email:
orders@intechopen.com
Share this page
This book is indexed in
Engineering » Industrial Engineering and Management
Multiprocessor Scheduling, Theory and Applications
Edited by Eugene Levner, ISBN 978-3-902613-02-8, Hard cover, 436 pages, Publisher: I-Tech Education and Publishing, Chapters published December 01, 2007 under CC BY-NC-SA 3.0 license
A major goal of the book is to continue a good tradition - to bring together reputable researchers from different countries in order to provide a comprehensive coverage of advanced and modern topics in scheduling not yet reflected by other books. The virtual consortium of the authors has been created by using electronic exchanges; it comprises 50 authors from 18 different countries who have submitted 23 contributions to this collective product. In this sense, the volume can be added to a bookshelf with similar collective publications in scheduling, started by Coffman (1976) and successfully continued by Chretienne et al. (1995), Gutin and Punnen (2002), and Leung (2004). This volume contains four major parts that cover the following directions: the state of the art in theory and algorithms for classical and non-standard scheduling problems; new exact optimization algorithms, approximation algorithms with performance guarantees, heuristics and metaheuristics; novel models and approaches to scheduling; and, last but least, several real-life applications and case studies.
- Introductory Chapter
Preface: Multiprocessor Scheduling, Theory and Applications - Chapter 1
Cyclic Scheduling in Robotic Cells: An Extension of Basic Models in Machine Scheduling Theory - Chapter 2
Combinatorial Models for Multi-Agent Scheduling Problems - Chapter 3
Scheduling under Unavailability Constraints to Minimize Flow-time Criteria - Chapter 4
Scheduling with Communication Delays - Chapter 5
Minimizing the Weighted Number of Late Jobs with Batch Setup Times and Delivery Costs on a Single Machine - Chapter 6
On-line Scheduling on Identical Machines for Jobs with Arbitrary Release Times - Chapter 7
A NeuroGenetic Approach for Multiprocessor Scheduling - Chapter 8
Heuristics for Unrelated Parallel Machine Scheduling with Secondary Resource Constraints - Chapter 9
A Hybrid Genetic Algorithm for the Re-Entrant Flow-Shop Scheduling Problem - Chapter 10
Hybrid Search Heuristics to Schedule Bottleneck Facility in Manufacturing Systems - Chapter 11
Solving a Multi-Objective No-Wait Flow Shop Problem by a Hybrid Multi-Objective Immune Algorithm - Chapter 12
Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs - Chapter 13
Integral Approaches to Integrated Scheduling - Chapter 14
Scheduling with Setup Considerations: An MIP Approach - Chapter 15
A New Mathematical Model for Flexible Flow Lines with Blocking Processor and Sequence-Dependent Setup Time - Chapter 16
Hybrid Job Shop and Parallel Machine Scheduling Problems: Minimization of Total Tardiness Criterion - Chapter 17
Identical Parallel Machine Scheduling with Dynamical Networks using Time-Varying Penalty Parameters - Chapter 18
A Heuristic Rule-Based Approach for Dynamic Scheduling of Flexible Manufacturing Systems - Chapter 19
A Geometric Approach to Scheduling of Concurrent Real-time Processes Sharing Resources - Chapter 20
Sequencing and Scheduling in the Sheet Metal Shop - Chapter 21
Decentralized Scheduling of Baggage Handling Using Multi-agent Technologies - Chapter 22
Synchronized Scheduling of Manufacturing and 3PL Transportation - Chapter 23
Scheduling for Dedicated Machine Constraint
