scientific article
From MaRDI portal
Publication:2741353
zbMath1072.90521MaRDI QIDQ2741353
Publication date: 23 September 2001
Full work available at URL: http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Preemptive scheduling of interval orders is polynomial
- NP-complete scheduling problems
- Optimal scheduling on parallel machines for a new order class
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Scheduling preemptive jobs with precedence constraints on parallel machines
- Optimal scheduling for two-processor systems
- Scheduling precedence graphs of bounded height
- Profile Scheduling of Opposing Forests and Level Orders
- Scheduling Interval-Ordered Tasks
- An Almost-Linear Algorithm for Two-Processor Scheduling
- Worst Case Analysis of Two Scheduling Algorithms
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Optimal Sequencing of Two Equivalent Processors
This page was built for publication:
