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

An effective ant colony optimization algorithm for multi-objective job-shop scheduling with equal-size lot-splitting

TL;DR: Five enhancements are made in the proposed ACO-based algorithms to enrich search patterns of ACO and improve its performance, including a new type of pheromone and greedy heuristic function and three new functions of state transition rules.
Journal ArticleDOI

Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows

TL;DR: This paper studies hybrid flowshops where jobs, if completed inside a due window, are considered on time and presents methods based on the simple concepts of iterated greedy and iterated local search, which yield superior results which are also demonstrated to be statistically significant.
Journal ArticleDOI

Parallel machine scheduling with machine availability and eligibility constraints

TL;DR: A polynomial time binary search algorithm is proposed to solve the problem of scheduling n independent jobs on m identical machines incorporating machine availability and eligibility constraints while minimizing the makespan.
Journal ArticleDOI

Optimal scheduling for flexible job shop operation

TL;DR: In this article, a new integer linear programming (ILP) model is proposed to schedule flexible job shop, discrete parts manufacturing industries that operate on a make-to-order basis.
Journal ArticleDOI

The Dual-Ants Colony

TL;DR: The Dual-Ants Colony (DAC) is developed, a novel hybrid Ant Colony Optimization (ACO) approach with dynamic history, based on an ants system with dual activities, which provides an effective integration of a local search and a set of dispatching rules.
Related Papers (5)