Single-machine scheduling

About: Single-machine scheduling is a(n) research topic. Over the lifetime, 2473 publication(s) have been published within this topic receiving 56288 citation(s).

Scheduling: Theory, Algorithms, and Systems

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.

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

Abstract: The theory of deterministic sequencing and scheduling has expanded rapidly during the past years. In this paper we survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory. Special cases considered are single machine scheduling, identical, uniform and unrelated parallel machine scheduling, and open shop, flow shop and job shop scheduling. We indicate some problems for future research and include a selective bibliography.

Complexity of machine scheduling problems

Abstract: We survey and extend the results on the complexity of machine scheduling problems. After a brief review of the central concept of NP-completeness we give a classification of scheduling problems on single, different and identical machines and study the influence of various parameters on their complexity. The problems for which a polynomial-bounded algorithm is available are listed and NP-completeness is established for a large number of other machine scheduling problems. We finally discuss some questions that remain unanswered.

Single-machine scheduling with learning considerations

Abstract: The focus of this work is to analyze learning in single-machine scheduling problems. It is surprising that the well-known learning effect has never been considered in connection with scheduling problems. It is shown in this paper that even with the introduction of learning to job processing times two important types of single-machine problems remain polynomially solvable.

Scheduling with time dependent processing times: Review and extensions

Abstract: In classical scheduling theory job processing times are constant However, there are many situations where processing time of a job depends on the starting time of the job in the queue This paper reviews the rapidly growing literature on single machine scheduling models with time dependent processing times Attention is focused on linear, piecewise linear and non-linear processing time functions for jobs We survey known results and introduce new solvable cases Finally, we identify the areas and give directions where further research is needed