- Applied mathematics
- >
- Operations research
- >
- Scheduling (computing)
- >
- Scheduling algorithms

- Applied mathematics
- >
- Theoretical computer science
- >
- Algorithms
- >
- Scheduling algorithms

- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Scheduling (computing)
- >
- Scheduling algorithms

- Fields of mathematics
- >
- Applied mathematics
- >
- Algorithms
- >
- Scheduling algorithms

- Fields of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Scheduling algorithms

- Mathematical optimization
- >
- Combinatorial optimization
- >
- Scheduling (computing)
- >
- Scheduling algorithms

- Network theory
- >
- Combinatorial optimization
- >
- Scheduling (computing)
- >
- Scheduling algorithms

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Scheduling algorithms

- Search algorithms
- >
- Combinatorial optimization
- >
- Scheduling (computing)
- >
- Scheduling algorithms

Longest-processing-time-first scheduling

Longest-processing-time-first (LPT) is a greedy algorithm for job scheduling. The input to the algorithm is a set of jobs, each of which has a specific processing-time. There is also a number m specif

Linear scheduling method

Linear scheduling method (LSM) is a graphical scheduling method focusing on continuous resource utilization in repetitive activities.

Critical path method

The critical path method (CPM), or critical path analysis (CPA), is an algorithm for scheduling a set of project activities. It is commonly used in conjunction with the program evaluation and review t

FIFO (computing and electronics)

In computing and in systems theory, FIFO is an acronym for first in, first out (the first in is the first out), a method for organizing the manipulation of a data structure (often, specifically a data

Dynamic priority scheduling

Dynamic priority scheduling is a type of scheduling algorithm in which the priorities are calculated during the execution of the system. The goal of dynamic priority scheduling is to adapt to dynamica

Heterogeneous earliest finish time

Heterogeneous earliest finish time (or HEFT) is a heuristic to schedule a set of dependent tasks onto a network of heterogenous workers taking communication time into account. For inputs HEFT takes a

Drift plus penalty

In the mathematical theory of probability, the drift-plus-penalty method is used for optimization of queueing networks and other stochastic systems. The technique is for stabilizing a queueing network

Graphical path method

The Graphical Path Method (GPM) is a mathematically based algorithm used in project management for planning, scheduling and resource control. GPM represents logical relationships of dated objects – su

Generalized processor sharing

Generalized processor sharing (GPS) is an ideal scheduling algorithm for process schedulers and network schedulers. It is related to the fair-queuing principle which groups packets into classes and sh

Multilevel queue

Multi-level queueing, used at least since the late 1950s/early 1960s, is a queue with a predefined number of levels. Items get assigned to a particular level at insert (using some predefined algorithm

Atropos scheduler

In computer science, Atropos is a real-time scheduling algorithm developed at Cambridge University. It combines the earliest deadline first algorithm with a best effort scheduler to make use of , whil

Event chain methodology

Event chain methodology is a network analysis technique that is focused on identifying and managing events and relationship between them (event chains) that affect project schedules. It is an uncertai

Completely fair queueing

Completely Fair Queuing (CFQ) is an I/O scheduler for the Linux kernel which was written in 2003 by Jens Axboe.

FINO

In computer science, FINO is a humorous scheduling algorithm. It is an acronym for first in, never out as opposed to traditional first in, first out (FIFO) and last in, first out (LIFO) algorithms. A

Event chain diagram

Event chain diagrams are visualizations that show the relationships between events and tasks and how the events affect each other. Event chain diagrams are introduced as a part of event chain methodol

Exponential backoff

Exponential backoff is an algorithm that uses feedback to multiplicatively decrease the rate of some process, in order to gradually find an acceptable rate. These algorithms find usage in a wide range

Top-nodes algorithm

The top-nodes algorithm is an algorithm for managing a resource reservation calendar. The algorithm has been first published in 2003, and has been improved in 2009. It is used when a resource is share

List scheduling

List scheduling is a greedy algorithm for Identical-machines scheduling. The input to this algorithm is a list of jobs that should be executed on a set of m machines. The list is ordered in a fixed or

Scheduling starvation

No description available.

Sequence step algorithm

A sequence step algorithm (SQS-AL) is an algorithm implemented in a discrete event simulation system to maximize resource utilization. This is achieved by running through two main nested loops: A sequ

© 2023 Useful Links.