Skip to search formSkip to main contentSkip to account menu

Interval scheduling

Interval scheduling is a class of problems in computer science, particularly in the area of algorithm design. The problems consider a set of tasks… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The fixed interval scheduling problem—also known as the personnel task scheduling problem—optimizes the allocation of available… 
2018
2018
To reduce the operating cost, leasing appropriate amount of public resources becomes a popular practice among small and medium… 
2016
2016
Effectively utilising available resources is an important task of a reservation system to help service providers improve their… 
2014
2014
Over the last few years, the importance of cloud services for file synchronization has been increasing. With the release of… 
2013
2013
We investigate dynamic algorithms for the interval scheduling problem. We focus on the case when the set of intervals is… 
2010
2010
A t-interval is a union of at most t half-open intervals on the real line. The special case where t = 1 is an interval. Often… 
2009
2009
This paper deals with non-preemptive online t-interval scheduling. A tinterval is a union of t half-open intervals (segments). In… 
2006
2006
Many embedded real-time applications have strict time constraints to perform computations and access I/O devices. However… 
2003
2003
Este trabajo se ocupa del problema de seleccionar y planificar un conjunto de pedidos para ser fabricados e inmediatamente… 
1998
1998
Employees who are motivated perform their jobs better. IS managers can enhance and leverage the human resource capability of…