Note on scheduling intervals on-line

DOI10.1016/0166-218X(95)00112-5MaRDI QIDQ1805461zbMATH OpenFDO

Authors U. Faigle, Willem M. Nawijn

Publication date 9 October 1995

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(95)00112-5

zbMATH Keywords

\(k\)-track assignmentcoloringgreedy algorithmidentical time windowsinterval orderoptimal on-line algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1003261
• A Greedy On-Line Algorithm for thek-Track Assignment Problem
• Online Interval Scheduling: Randomized and Multiprocessor Cases
• The k-track assignment problem

Cites work

• A linear-time recognition algorithm for interval dags
• Advances in computing and information - ICCI '91. International conference on computing and information, Ottawa, Canada, May 27-29, 1991. Proceedings
• scientific article; zbMATH DE number 1003261 (Why is no real title available?)
• Minimum loss scheduling problems
• On chain and antichain families of a partially ordered set
• Randomized online algorithms for maximizing busy time interval scheduling
• The k-track assignment problem

Cited in

(27)

• Randomized online interval scheduling
• Competitive on-line scheduling of continuous-media streams
• Online interval scheduling with a bounded number of failures
• Online C-benevolent job scheduling on multiple machines
• Competitive algorithms for multistage online scheduling
• On the approximability of an interval scheduling problem
• Scheduling dyadic intervals
• Randomized online algorithms for maximizing busy time interval scheduling
• Multistage interval scheduling games
• Online interval scheduling to maximize total satisfaction
• Online interval scheduling on two related machines: the power of lookahead
• The k-Track assignment problem on partial orders
• Online scheduling of jobs with fixed start times on related machines
• scientific article; zbMATH DE number 1003261 (Why is no real title available?)
• Improved Randomized Results for That Interval Selection Problem
• A Greedy On-Line Algorithm for thek-Track Assignment Problem
• On-line scheduling of equal-length intervals on parallel machines
• Blocking probabilities in Erlang loss queues with advance reservation
• Time-Multiplexed Online Checking
• Interval scheduling on related machines
• scientific article; zbMATH DE number 7765369 (Why is no real title available?)
• Any-order online interval selection
• Priority algorithms with advice for disjoint path allocation problems
• Interval scheduling games
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Bicriteria scheduling for contiguous and non contiguous parallel tasks
• Improved randomized results for the interval selection problem

This page was built for publication: Note on scheduling intervals on-line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805461)