Publisher Summary This chapter discusses different types of sequencing and scheduling
problems, and describes different types of algorithms and the concepts of complexity theory …

The scheduling of computer and manufacturing systems has been the subject of extensive
research for over forty years. In addition to computers and manufacturing, scheduling theory …

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 …

The theory of deterministic sequencing and scheduling has expanded rapidly during the
past years. We survey the state of the art with respect to optimization and approximation …

We shall be concerned with finding optimal preemptive schedules on parallel machines,
subject to release dates for the jobs. Two polynomial-time algorithms are presented. The first …

Recent Results in the Theory of Machine Scheduling Page 1 Recent Results in the Theory of
Machine Scheduling E. L. Lawler University of California, College of Engineering, Computer …

Das Buch führt in grundlegende Modelle und Methoden für die Planung, Steuerung und
Überwachung von Unternehmensprozessen ein. Im Mittelpunkt der Diskussion steht die …

Publisher Summary This chapter discusses the deterministic problems of scheduling tasks
on machines (processors), which is one of the most rapidly expanding areas of …

Abstract The Polytope Scheduling Problem (PSP) was introduced by Im, Kulkarni, and
Munagala (JACM 2018) as a very general abstraction of resource allocation over time and …

In dial-a-ride problems, items have to be transported from a source to a destination. The
characteristics of the servers involved as well as the specific requirements of the rides may …