scispace - formally typeset
Topic

Scheduling (computing)

About: Scheduling (computing) is a(n) research topic. Over the lifetime, 78638 publication(s) have been published within this topic receiving 1341254 citation(s). The topic is also known as: sched & schedule.
Papers
More filters

Journal ArticleDOI
01 Jan 1973-Journal of the ACM
TL;DR: The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service and it is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization.
Abstract: The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets. It is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadlines. A combination of these two scheduling techniques is also discussed.

6,912 citations


Book
15 Jul 1994-
TL;DR: 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.

6,118 citations


Book
03 Jan 1989-
Abstract: The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets. It is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadlines. A combination of these two scheduling techniques is also discussed.

5,242 citations


Journal ArticleDOI
TL;DR: An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
Abstract: The optimum routing of a fleet of trucks of varying capacities from a central depot to a number of delivery points may require a selection from a very large number of possible routes, if the number of delivery points is also large. This paper, after considering certain theoretical aspects of the problem, develops an iterative procedure that enables the rapid selection of an optimum or near-optimum route. It has been programmed for a digital computer but is also suitable for hand computation.

3,454 citations


Journal ArticleDOI
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Abstract: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints. Given the intrinsic difficulty of this problem class, approximation methods seem to offer the most promise for practical size problems. After describing a variety of heuristics, we conduct an extensive computational study of their performance. The problem set includes routing and scheduling environments that differ in terms of the type of data used to generate the problems, the percentage of customers with time windows, their tightness and positioning, and the scheduling horizon. We found that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.

2,900 citations


Network Information
Related Topics (5)
Dynamic priority scheduling

28.2K papers, 585.1K citations

96% related
Fair-share scheduling

24.7K papers, 516.6K citations

95% related
Heuristic

23.1K papers, 565.2K citations

94% related
Heuristic (computer science)

28K papers, 596K citations

94% related
Rate-monotonic scheduling

15.8K papers, 350.4K citations

94% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202250
20212,713
20203,932
20194,708
20184,447
20174,112

Top Attributes

Show by:

Topic's top 5 most impactful authors

Ness B. Shroff

107 papers, 5.9K citations

Rajkumar Buyya

100 papers, 10.6K citations

T.C.E. Cheng

99 papers, 5.1K citations

Eytan Modiano

91 papers, 2.7K citations

Keqin Li

75 papers, 2.5K citations