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
Proceedings ArticleDOI
Distributed algorithm design for multi-robot task assignment with deadlines for tasks
TL;DR: This paper presents a distributed auction-based algorithm for multi-robot task assignment and proves that the solution is almost-optimal, and presents simulation results to depict the performance of the algorithm.
Journal ArticleDOI
The use of flowlines to simplify routing complexity in two-stage flowshops
TL;DR: In this paper, the authors propose a decomposition of two-stage flowshops into smaller independent flowlines that allow for unidirectional routing only, by means of a Dynamic Programming algorithm (DP).
Book ChapterDOI
On grid performance evaluation using synthetic workloads
Alexandru Iosup,Dick Epema,Carsten Franke,Alexander Papaspyrou,Lars Schley,Baiyi Song,Ramin Yahyapour +6 more
TL;DR: This paper introduces a set of grid performance objectives based on traditional and grid-specific performance metrics, and synthesizes the requirements for realistic grid workload modeling, e.g. co-allocation, data and network management, and failure modeling.
Journal ArticleDOI
Sequencing CONWIP flow-shops: Analysis and heuristics
TL;DR: In this article, the authors address the backlog sequencing problem in a flow shop controlled by a CONWIP production control system, with the objective to minimize the makespan, and analyze its similarities and differences with the unconstrained permutation flow-shop problem.
Journal ArticleDOI
Scheduling and lot streaming in flowshops with no-wait in process
TL;DR: This work develops a dynamic programming algorithm to generate all the nondominated schedule profiles for each product that are required to formulate the flowshop problem as a generalized traveling salesman problem, and develops and computationally test an efficient heuristic for this problem.