Everything about Interval scheduling
Class of problems in computer science
Interval scheduling is a class of problems in computer science, particularly in the area of algorithm design. The problems consider a set of tasks. Each task is represented by an interval describing the time in which it needs to be processed by some machine. For instance, task A might run from 2:00 to 5:00, task B might run from 4:00 to 10:00 and task C might run from 9:00 to 11:00. A subset of intervals is compatible if no two intervals overlap on the machine/resource. For example, the subset {A,C} is compatible, as is the subset {B}; but neither {A,B} nor {B,C} are compatible subsets, because the corresponding intervals within each subset overlap. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Interval schedulingA 5-minute orientation
- Skim a recent paper: An efficient interval many-objective evolutionary algorithm for cloud task scheduling problem under uncertaintyInfluential work since 2022
- Pick up a classic book: Appointment BookThe most-reprinted book on the subject
- Read the landmark paper: Interval scheduling: A surveyCited 192 times
- Go sideways: Maximum disjoint setA closely related topic
- Go sideways: 2-satisfiabilityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Interval scheduling: A survey
Scheduling Interval-Ordered Tasks
On the approximability of an interval scheduling problem
Interval Scheduling on identical machines
Interval scheduling and colorful independent sets
Optimal interval scheduling with a resource constraint
Randomized online interval scheduling
Earth Observation Satellite Scheduling With Interval-Varying Profits
🆕 Influential since 2022
An efficient interval many-objective evolutionary algorithm for cloud task scheduling problem under uncertainty
Integrated energy system scheduling model based on non-complete interval multi-objective fuzzy optimization
A stochastic-interval model for optimal scheduling of PV-assisted multi-mode charging stations
Emergency logistics scheduling with multiple supply-demand points based on grey interval
Single machine scheduling with non-availability interval and optional job rejection
📚 Books worth reading
- 📕Appointment BookLeseevo Appointment Book · 2020
BARBER APPOINTMENT BOOKMemoris_Appointment Publishing · 2019- 📕Appointment BookMaggie Nguyen · 2019
- 📕Appointment BookMary W. Publishing · 2018
- 📕Barbershop Appointment BookSbr_ Appointment PUBLISHING · 2021
- 📕Appointment BookMaggie Nguyen · 2019
- 📕Hair Salon Appointment BookMemoris_Appointment Publishing · 2019
- 📕Therapist Planner 2021Aby Library · 2021
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Maximum disjoint set In computational geometry, a maximum disjoint set (MDS) is a largest set of non-overlapping geometric shapes selected from a given set of candidate shapes…
- 2-satisfiability In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values…
- 3-dimensional matching In the mathematical discipline of graph theory, a 3-dimensional matching is a generalization of bipartite matching (also known as 2-dimensional matching)…
- Charging argument In computer science, a charging argument is used to compare the output of an optimization algorithm to an optimal solution. It is typically used to show…
- Cut (graph theory) In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one…
- Set cover problem The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. Given a set of elements {1…
- Maximum satisfiability problem In computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a given…
- Gap reduction In computational complexity theory, a gap reduction is a reduction to a particular type of decision problem, known as a c-gap problem. Such reductions…