Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,694,781 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
2-satisfiability
Algorithm
Boolean satisfiability problem
Charging argument
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Efficient Models, Formulations and Algorithms for Some Variants of Fixed Interval Scheduling Problems
D. Ramesh
,
M. Krishnamoorthy
,
Andreas T. Ernst
2018
Corpus ID: 56884581
The fixed interval scheduling problem—also known as the personnel task scheduling problem—optimizes the allocation of available…
Expand
2018
2018
Dynamic Idle Time Interval Scheduling for Hybrid Cloud Workflow Management System
Wenqian Wu
,
Jie Zhu
,
Haiping Huang
,
Xiaolong Xu
,
Yi Zhang
IEEE International Conference on Systems, Man and…
2018
Corpus ID: 58671240
To reduce the operating cost, leasing appropriate amount of public resources becomes a popular practice among small and medium…
Expand
2015
2015
Production planning based on demand forecasting
Aamani Adepu
,
Nadiye O. Erdil
International Conference on Industrial…
2015
Corpus ID: 36779655
In any manufacturing industry, one of the areas where business leadership can focus to achieve cost reduction is inventory…
Expand
2015
2015
Scheduling Non-Unit Jobs to Minimize Calibrations
Jeremy T. Fineman
,
Brendan Sheridan
ACM Symposium on Parallelism in Algorithms and…
2015
Corpus ID: 17389249
The recently proposed Integrated Stockpile Evaluation (ISE) problem extends a classic offline scheduling problem where n jobs…
Expand
2013
2013
Dynamising Interval Scheduling: The Monotonic Case
A. Gavryushkin
,
B. Khoussainov
,
Mikhail Kokho
,
J. Liu
International Workshop on Combinatorial…
2013
Corpus ID: 10038556
We investigate dynamic algorithms for the interval scheduling problem. We focus on the case when the set of intervals is…
Expand
2010
2010
Online Scheduling Intervals and t-Intervals
Unnar Th. Bachmann
,
M. Halldórsson
,
H. Shachnai
2010
Corpus ID: 16371345
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…
Expand
2009
2009
Online t-interval scheduling
U. Bachmann
2009
Corpus ID: 17703324
This paper deals with non-preemptive online t-interval scheduling. A tinterval is a union of t half-open intervals (segments). In…
Expand
2005
2005
Planificación operacional de la capacidad en logística de procesos con restricciones de tiempo.
J. Sánchez
,
G. Caro
,
J. Moreno
2005
Corpus ID: 178652540
La logistica de procesos sujeta a restricciones de tiempo aparece en sistemas donde las tareas tienen que ser completadas dentro…
Expand
1998
1998
2-0110 Individual Motivation Profiles : The Key to Increased Productivity and Job Satisfaction
James C. Wetherbe
,
M. Wetherbe
1998
Corpus ID: 26176696
Employees who are motivated perform their jobs better. IS managers can enhance and leverage the human resource capability of…
Expand
1990
1990
Solution of a class of interval scheduling problems using network flows
L. Kroon
,
G. Ruhe
1990
Corpus ID: 61277666
We consider a generalization of the Fixed Job Scheduling Problem, where jobs with fixed start and finish time and from different…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE