- 438 pages
- English
- PDF
- Available on iOS & Android
About this book
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.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Multiprocessor Scheduling, Theory and Applications
- Preface
- Contents
- 1. Cyclic Scheduling in Robotic Cells: An Extension of Basic Models in MachineScheduling Theory
- 2. Combinatorial Models for Multi-agent Scheduling Problems
- 3. Scheduling under Unavailability Constraints to Minimize Flow-time Criteria
- 4. Scheduling with Communication Delays
- 5. Minimizing the Weighted Number of Late Jobs with Batch Setup Times and Delivery Costs on a Single Machine
- 6. On-line Scheduling on Identical Machines for Jobs with Arbitrary Release Times
- 7. A NeuroGenetic Approach for Multiprocessor Scheduling
- 8. Heuristics for Unrelated Parallel Machine Scheduling with Secondary Resource Constraints
- 9. A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem
- 10. Hybrid Search Heuristics to Schedule Bottleneck Facility in Manufacturing Systems
- 11. Solving a Multi-Objective No-Wait Flow Shop Problem by a Hybrid Multi-Objective Immune Algorithm
- 12. Concurrent Open shop Problem to Minimize the Weighted Number of Late Jobs1
- 13. Integral Approaches to Integrated Scheduling
- 14. Scheduling with Setup Considerations: An MIP Approach
- 15. A New Mathematical Model for Flexible Flow Lines with Blocking Processor and Sequence-Dependent Setup Time
- 16. Hybrid Job Shop and parallel machine scheduling problems: minimization of total tardiness criterion
- 17. Identical Parallel Machine Scheduling with Dynamical Networks using Time-Varying Penalty Parameters
- 18. A Heuristic Rule-Based Approach for Dynamic Scheduling of Flexible Manufacturing Systems
- 19. A geometric approach to scheduling of concurrent real-time processes sharing resources
- 20. Sequencing and scheduling in the sheet metal shop
- 21. Decentralized scheduling of baggage handling using multi-agent technologies
- 22. Synchronized scheduling of manufacturing and 3PL transportation
- 23. Scheduling for Dedicated Machine Constraint