scispace - formally typeset
Open AccessBook

Scheduling: Theory, Algorithms, and Systems

Reads0
Chats0
TLDR
Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
Abstract
This book on scheduling covers theoretical models as well as scheduling problems in the real world. Author Michael Pinedo also includes a CD that contains slide-shows from industry and movies dealing with implementations of scheduling systems. The book consists of three parts. The first part focuses on deterministic scheduling with the associated combinatorial problems. The second part covers probabilistic scheduling models. In this part it is assumed that processing times and other problem data are not known in advance. The third part deals with scheduling in practice. It covers heuristics that are popular with practitioners and discusses system design and development issues. Each chapter contains a series of computational and theoretical exercises. This book is of interest to theoreticians and practitioners alike. Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource. Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments. Michael Pinedo is the Julius Schlesinger Professor of Operations Management at New York University.

read more

Citations
More filters
Journal ArticleDOI

Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions

TL;DR: Two new genetic algorithms including a pure genetic algorithm and a genetic algorithm along with a heuristic procedure are proposed to tackle a resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions.
Journal ArticleDOI

A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness

TL;DR: A simple criterion to integrate machine availability constraints and scheduling decisions simultaneously is established and a hybrid meta-heuristic to tackle the given problem is proposed, called EMSA.
Book ChapterDOI

Stability Radius of an Optimal Schedule: A Survey and Recent Developments

TL;DR: In this paper, a survey of recent results in the calculation of the stability radius of an optimal schedule for a general shop scheduling problem which denotes the largest quantity of independent variations of the processing times of the operations such that this schedule remains optimal is presented.
Journal ArticleDOI

A summary of periodic and random inspection policies

TL;DR: The backup model where the system goes back to the latest checking time when it has failed is taken up and analyzed, by using the inspection policy.
Patent

Methods and arrangements for ordering changes in computing systems

TL;DR: In this article, methods and arrangements for automatically determining allowable sequences of changes, i.e., sequences where the order in which changes are carried out will transition a computing system from a workable state into another workable one, are disclosed.
Related Papers (5)