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… 
2015
2015
In any manufacturing industry, one of the areas where business leadership can focus to achieve cost reduction is inventory… 
2015
2015
The recently proposed Integrated Stockpile Evaluation (ISE) problem extends a classic offline scheduling problem where n jobs… 
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… 
2005
2005
La logistica de procesos sujeta a restricciones de tiempo aparece en sistemas donde las tareas tienen que ser completadas dentro… 
1998
1998
Employees who are motivated perform their jobs better. IS managers can enhance and leverage the human resource capability of… 
1990
1990
We consider a generalization of the Fixed Job Scheduling Problem, where jobs with fixed start and finish time and from different…