To purchase hard copies of this book, please email:
orders@intechopen.com
By only printing on demand InTech ensures our carbon footprint is kept to a minimum.
The data below shows the environmental impact of printing one single book:
62.91 kg wood
3.38 g CO2
57.12 ml Water
Share this page
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, Published: December 01, 2007 under CC BY-NC-SA 3.0 license, in subject Industrial Engineering and Management
DOI: 10.5772/52
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.
This book is indexed in:
Book contents
- Chapter 1Preface: Multiprocessor Scheduling, Theory and Applications
- Chapter 2Integral Approaches to Integrated Scheduling
- Chapter 3Scheduling with Setup Considerations: An MIP Approach
- Chapter 4A New Mathematical Model for Flexible Flow Lines with Blocking Processor and Sequence-Dependent Setup Time
- Chapter 5Hybrid Job Shop and Parallel Machine Scheduling Problems: Minimization of Total Tardiness Criterion
- Chapter 6Identical Parallel Machine Scheduling with Dynamical Networks using Time-Varying Penalty Parameters
- Chapter 7A Heuristic Rule-Based Approach for Dynamic Scheduling of Flexible Manufacturing Systems
- Chapter 8A Geometric Approach to Scheduling of Concurrent Real-time Processes Sharing Resources
- Chapter 9Sequencing and Scheduling in the Sheet Metal Shop
- Chapter 10Decentralized Scheduling of Baggage Handling Using Multi-agent Technologies
- Chapter 11Synchronized Scheduling of Manufacturing and 3PL Transportation
- Chapter 12Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs
- Chapter 13Solving a Multi-Objective No-Wait Flow Shop Problem by a Hybrid Multi-Objective Immune Algorithm
- Chapter 14Cyclic Scheduling in Robotic Cells: An Extension of Basic Models in Machine Scheduling Theory
- Chapter 15Combinatorial Models for Multi-Agent Scheduling Problems
- Chapter 16Scheduling under Unavailability Constraints to Minimize Flow-time Criteria
- Chapter 17Scheduling with Communication Delays
- Chapter 18Minimizing the Weighted Number of Late Jobs with Batch Setup Times and Delivery Costs on a Single Machine
- Chapter 19On-line Scheduling on Identical Machines for Jobs with Arbitrary Release Times
- Chapter 20A NeuroGenetic Approach for Multiprocessor Scheduling
- Chapter 21Heuristics for Unrelated Parallel Machine Scheduling with Secondary Resource Constraints
- Chapter 22A Hybrid Genetic Algorithm for the Re-Entrant Flow-Shop Scheduling Problem
- Chapter 23Hybrid Search Heuristics to Schedule Bottleneck Facility in Manufacturing Systems
- Chapter 24Scheduling for Dedicated Machine Constraint
