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
An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling
Bo Liu,Ling Wang,Yihui Jin +2 more
TL;DR: This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem.
Book
Principles of Sequencing and Scheduling
Kenneth R. Baker,Dan Trietsch +1 more
TL;DR: The authors begin with an introduction and overview of sequencing and scheduling, including single-machine sequencing, optimization and heuristic solution methods, and models with earliness and tardiness penalties, then present and integrated with deterministic models.
Journal ArticleDOI
Job-shop scheduling with blocking and no-wait constraints
TL;DR: It is shown that several key properties, used to design heuristic procedures, do not hold in the blocking and no-wait cases, while some of the most effective ideas used to develop branch and bound algorithms can be easily extended.
Journal ArticleDOI
A survey of the state-of-the-art of common due date assignment and scheduling research
TL;DR: A unified framework of the common due date assignment and scheduling problems in the deterministic case is provided by surveying the literature concerning the models involving single machine and parallel machines by finding an optimal value of thecommon due date and the related optimal schedule.
Journal ArticleDOI
A discrete version of particle swarm optimization for flowshop scheduling problems
TL;DR: A PSO algorithm, extended from discrete PSO, for flowshop scheduling, which incorporates a local search scheme into the proposed algorithm, called PSO-LS, and shows that the local search can be really guided by PSO in the approach.