scispace - formally typeset
Open AccessBook

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Reads0
Chats0
TLDR
This book discusses Real-Time Scheduling Problems, Scheduling Models, Stochastic Scheduling, and Online Deterministic Scheduling as well as some basic Scheduling Algorithms and Complexity.
Abstract
Introduction Introduction and Notation, Joseph Y-T. Leung A Tutorial on Complexity, Joseph Y-T. Leung Some Basic Scheduling Algorithms, Joseph Y-T. Leung Classical Scheduling Problems Elimination Rules for Job-shop Scheduling Problem: Overview and Extensions, Jacques Carlier, Laurent Peridy, Eric Pinson, and David Rivreau Flexible Hybrid Flowshops, George Vairaktarakis Open Shop Scheduling, Teofilo F. Gonzalez Cycle Shop Scheduling, Vadim G. Timkovsky Reducibility among Scheduling Classes, Vadim G. Timkovsky Parallel Scheduling for Early Completion, Bo Chen Minimizing the Maximum Lateness, Hans Kellerer Approximation Algorithms for Minimizing Average Weighted Completion Time, Chandra Chekuri and Sanjeev Khanna Minimizing the Number of Tardy Jobs, Marjan van den Akker and Han Hoogeveen Branch-and-Bound Algorithms for Total Weighted Tardiness, Antoino Jouglet, Philippe Baptiste, and Jacques Carlier Scheduling Equal Processing Time Jobs, Philippe Baptiste and Peter Brucker Online Scheduling, Kirk Pruhs, Jiri Sgall, and Eric Torng Convex Quadratic Relaxations in Scheduling, Jay Sethuraman Other Scheduling Models The Master/Slave Scheduling Model, Sartaj Sahni and George Vairaktarakis Scheduling in Bluetooth Networks, Yong Man Kim and Ten H. Lai Fair Sequences, Wieslaw Kubiak Due-Date Quotation Models and Algorithms, Philip Kaminsky and Dorit Hochbaum Scheduling with Due-Date Assignment, Valery S. Gordon, Jean-Marie Proth, and Vitaly A. Strusevich Machine Scheduling with Availability Constraints, Chung-Yee Lee Scheduling with Discrete Resource Constraints, J. B_lazewicz, N. Brauner, and G. Finke Scheduling with Resource Constraints-Continuous Resources, Joanna J'ozefowska and Jan Weglarz Scheduling Parallel Tasks-Algorithms and Complexity, M. Drozdowski Scheduling Parallel Tasks Approximation Algorithms, Pierre-Franc' ois Dutot, Gr'egory Mouni'e, and Denis Trystram Real-Time Scheduling The Pinwheel: A Real-Time Scheduling Problem, Deji Chen and Aloysivs Mok Scheduling Real-Time Tasks: Algorithms and Complexity, Sanjay Baruah and Joael Goossens Real Time Synchronization Protocols, Lui Sha and Marco Caccamo Fair Scheduling of Real-Time Tasks on Multiprocessors, James Anderson, Philip Holman, and Anand Srinivasan A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms, John Carpenter, Shelby Funk, Philip Holman, Anand Srinivasan, James Anderson, and Sanjoy Baruah Approximation Algorithms for Scheduling Time-Critical Jobs on Multiprocessor System, Sudarshan K. Dhall Scheduling Overloaded Real-Time Systems with Competitive/Worst Case Guarantees, Gilad Koren and Dennis Shasha Minimizing TotalWeighted Error for Imprecise Computation Tasks and Related Problems, Joseph Y-T. Leung Dual Criteria Optimization Problems for Imprecise Computation Tasks, Kevin I-J Ho Periodic Reward-Based Scheduling and Its Application to Power-Aware Real-Time Systems, Hakan Aydin, Rami Melhem, and Daniel Mosse Routing Real-Time Messages on Networks, G. Young Stochastic Scheduling and Queueing Networks Offline Deterministic Scheduling, Stochastic Scheduling, and Online Deterministic Scheduling: A Comparative Overview, Michael Pinedo Stochastic Scheduling with Earliness and Tardiness Penalties, Xiaoqiang Cai and Xian Zhou Developments in Queueing Networks with Tractable Solutions, Xiuli Chao Scheduling in Secondary Storage Systems, Alexander Thomasian Selfish Routing on the Internet, Artur Czumaj Applications Scheduling of Flexible Resources in Professional Service Firms, Yalcin Akcay, Anantaram Balakrishnan, and Susan H. Xu Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals, Edmund Kieran Burke, Patrick De Causmaecker and Greet Vanden Berghe University Timetabling, Sanja Petrovic and Edmund Burke Adapting the GATES Architecture to Scheduling Faculty, R. P. Brazile and K. M. Swigger Constraint Programming for Scheduling, John J. Kanet, Sanjay L. Ahire, and Michael F. Gorman Batch Production Scheduling in the Process Industries, Karsten Gentner, Klaus Neumann, Christoph Schwindt, and Norbert Trautmann A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem, Richa Agarwal, Ravinder K. Ahuja, Gilbert Laporte, and Zuo-Jun "Max" Shen Scheduling Problems in the Airline Industry, Xiangtong Qi, Jian Yang and Gang Yu Bus and Train Driver Scheduling, Raymond S. K. Kwan Sports Scheduling, Kelly Easton, George Nemhauser, and Michael Trick Index

read more

Citations
More filters
Journal ArticleDOI

Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan

TL;DR: If T'=T, BFD-LPT algorithm is the best possible approximation algorithm, and if the total processing time of the jobs is larger than 2m(T'+TM) and min{ρi}≥T, where T"M is the amount of time needed to perform one maintenance activity, then the makespan derived from BFD/T-approximation algorithm is no more than that of the optimal makespan.
Book ChapterDOI

An Extended Implementation of the Great Deluge Algorithm for Course Timetabling

TL;DR: An extended version of the Great Deluge Algorithm for the Course Timetabling problem which, while avoiding the problem of getting trapped in local optima, uses simple Neighbourhood search heuristics to obtain solutions in a relatively short amount of time.
Journal ArticleDOI

Constraint satisfaction techniques in planning and scheduling

TL;DR: This paper introduces the main definitions and techniques of constraint satisfaction, planning and scheduling from the Artificial Intelligence point of view.
Proceedings ArticleDOI

SMT-based Task- and Network-level Static Schedule Generation for Time-Triggered Networked Systems

TL;DR: This paper uses Satisfiability Modulo Theories (SMT) to formulate the scheduling constraints and solve the resulting problem using a state-of-the-art SMT solver, and introduces a novel incremental scheduling approach, based on the demand bound test for asynchronous constrained-deadline periodic tasks, which significantly improves scalability for the average case without sacrificing schedulability.
Book ChapterDOI

Fuzzy multiple heuristic orderings for examination timetabling

TL;DR: The proposed algorithm has been tested on 12 benchmark examination timetabling data sets and the results show that this approach can produce good quality solutions and there is significant potential to extend the approach by including a larger range of heuristics.