On-line scheduling of jobs with fixed start and end times
From MaRDI portal
Publication:1331962
DOI10.1016/0304-3975(94)90150-3zbMath0810.68068OpenAlexW1980135493MaRDI QIDQ1331962
Publication date: 29 August 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90150-3
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (43)
Scheduling broadcasts with deadlines ⋮ Improved on-line broadcast scheduling with deadlines ⋮ The Temp Secretary Problem ⋮ Scheduling Multipacket Frames with Frame Deadlines ⋮ On-line production order scheduling with preemption penalties ⋮ Online interval scheduling on a single machine with finite lookahead ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Primal-dual analysis for online interval scheduling problems ⋮ Online selection of intervals and \(t\)-intervals ⋮ Online scheduling with preemption or non-completion penalties ⋮ Online scheduling with immediate and reliable lead-time quotation ⋮ Approximation algorithms for stochastic online matching with reusable resources ⋮ Online interval scheduling on two related machines: the power of lookahead ⋮ Scheduling multipacket frames with frame deadlines ⋮ On-line scheduling of equal-length intervals on parallel machines ⋮ Improved bounds for randomized preemptive online matching ⋮ Online interval scheduling with a bounded number of failures ⋮ Improved Randomized Results for That Interval Selection Problem ⋮ Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs ⋮ A near optimal scheduler for on-demand data broadcasts ⋮ Optimally Handling Commitment Issues in Online Throughput Maximization ⋮ Online C-benevolent job scheduling on multiple machines ⋮ Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. ⋮ Maximizing Throughput in Flow Shop Real-Time Scheduling ⋮ Competitive algorithms for multistage online scheduling ⋮ Improving LTL truck load utilization on line ⋮ Improved randomized online scheduling of intervals and jobs ⋮ Interval scheduling on related machines ⋮ Lower bounds on online deadline scheduling with preemption penalties ⋮ A note on on-line broadcast scheduling with deadlines ⋮ Improved randomized results for the interval selection problem ⋮ Improved Randomized Online Scheduling of Unit Length Intervals and Jobs ⋮ Multistage interval scheduling games ⋮ Online interval scheduling to maximize total satisfaction ⋮ A general framework for handling commitment in online throughput maximization ⋮ Randomized online interval scheduling ⋮ Online interval scheduling: Randomized and multiprocessor cases ⋮ Scheduling parallel tasks with individual deadlines ⋮ A tight lower bound for job scheduling with cancellation ⋮ Pricing and scheduling decisions with leadtime flexibility ⋮ ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES ⋮ Competitive on-line scheduling of continuous-media streams ⋮ Online scheduling of jobs with fixed start times on related machines
Cites Work
- Unnamed Item
- Scheduling jobs with fixed start and end times
- An on-line graph coloring algorithm with sublinear performance ratio
- An Effective Version of Dilworth's Theorem
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- A Greedy On-Line Algorithm for thek-Track Assignment Problem
This page was built for publication: On-line scheduling of jobs with fixed start and end times
