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

Optimal makespan scheduling with given bounds of processing times

TL;DR: This paper presents an approach to deal with the general shop scheduling problem with the objective of minimizing the makespan under uncertain scheduling environments based on an improved stability analysis of an optimal makespan schedule.
Journal ArticleDOI

Aircraft landing problems with aircraft classes

TL;DR: This article focuses on the aircraft landing problem that is to assign landing times to aircraft approaching the airport under consideration, and develops algorithms to solve the corresponding problem in polynomial time.
Journal ArticleDOI

Minimizing the total completion time in a distributed two stage assembly system with setup times

TL;DR: Computational results indicate that the performances of the HDDE-RVNS and HGA- RVNS are not much affected by the number of machines at the first stage and factories, and the experimental results also show that the RVNS-based local search steps in both HGA/RV NS and HDDE/RvNS are efficient and effective.
Journal ArticleDOI

An ant colony optimization heuristic for an integrated production and distribution scheduling problem

TL;DR: In this article, the authors considered an integrated production and distribution scheduling problem in which jobs are first processed by one of the unrelated parallel machines and then distributed to corresponding customers by capacitated vehicles without intermediate inventory.
Journal ArticleDOI

An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems

TL;DR: An improved discrete artificial bee colony (IDABC) algorithm is proposed for this problem to minimize the makespan and is effective and efficient comparing with several state-of-the-art algorithms on the same benchmark instances.
Related Papers (5)