Approximation scheduling algorithms: a survey
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3689144 (Why is no real title available?)
- scientific article; zbMATH DE number 3742605 (Why is no real title available?)
- scientific article; zbMATH DE number 3780550 (Why is no real title available?)
- scientific article; zbMATH DE number 3786461 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- scientific article; zbMATH DE number 3557207 (Why is no real title available?)
- A Level Algorithm for Preemptive Scheduling
- A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- A vector-sum theorem in two-dimensional space
- Algorithms for Scheduling Independent Tasks
- Algorithms for Scheduling Tasks on Unrelated Processors
- An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
- An Analysis of Preemptive Multiprocessor Job Scheduling
- An Application of Bin-Packing to Multiprocessor Scheduling
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Bounds for Certain Multiprocessing Anomalies
- Bounds for LPT Schedules on Uniform Processors
- Bounds for List Schedules on Uniform Processors
- Bounds for Multifit Scheduling on Uniform Processors
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Bounds for naive multiple machine scheduling with release times and deadlines
- Bounds on Multiprocessing Timing Anomalies
- Bounds on list scheduling of UET tasks with restricted resource constraints
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fast algorithms for bin packing
- First fit decreasing scheduling on uniform multiprocessors
- Flowshop scheduling with limited temporary storage
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Non deterministic polynomial optimization problems and their approximations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Resource constrained scheduling as generalized bin packing
- Scheduling Independent Tasks on Uniform Processors
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Scheduling subject to resource constraints: Classification and complexity
- Scheduling the Open Shop to Minimize Mean Flow Time
- Task Scheduling on a Multiprocessor System with Independent Memories
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Worst Case Analysis of Two Scheduling Algorithms
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(11)- An experimental study of LP-based approximation algorithms for scheduling problems
- A survey of methods for the solution of problems of scheduling theory
- scientific article; zbMATH DE number 444983 (Why is no real title available?)
- Approximation algorithms for scheduling with reservations
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
- scientific article; zbMATH DE number 1982192 (Why is no real title available?)
- Analysis of the twisting department at superior cable corporation: A case study
- scientific article; zbMATH DE number 3989090 (Why is no real title available?)
- Parallel machine batching and scheduling with deadlines
- Vyacheslav Tanaev: contributions to scheduling and related areas
- scientific article; zbMATH DE number 4147846 (Why is no real title available?)
This page was built for publication: Approximation scheduling algorithms: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4207781)
