Approximation scheduling algorithms: a survey
From MaRDI portal
Publication:4207781
DOI10.1080/02331938908843507zbMath0688.90032OpenAlexW2065029766WikidataQ58616947 ScholiaQ58616947MaRDI QIDQ4207781
Alexander V. Tuzikov, Vyacheslav Tanaev, Ya. M. Shafransky, Mikhail Y. Kovalyov, Vitaly A. Strusevich
Publication date: 1989
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938908843507
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Vyacheslav Tanaev: contributions to scheduling and related areas, Analysis of the twisting department at superior cable corporation: A case study, Parallel machine batching and scheduling with deadlines, Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling subject to resource constraints: Classification and complexity
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- First fit decreasing scheduling on uniform multiprocessors
- A vector-sum theorem in two-dimensional space
- Non deterministic polynomial optimization problems and their approximations
- Resource constrained scheduling as generalized bin packing
- Bounds on list scheduling of UET tasks with restricted resource constraints
- Fast algorithms for bin packing
- Bounds for naive multiple machine scheduling with release times and deadlines
- Scheduling Independent Tasks on Uniform Processors
- Bounds for Multifit Scheduling on Uniform Processors
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- An Analysis of Preemptive Multiprocessor Job Scheduling
- Bounds for List Schedules on Uniform Processors
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Algorithms for Scheduling Tasks on Unrelated Processors
- Flowshop scheduling with limited temporary storage
- A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- Scheduling the Open Shop to Minimize Mean Flow Time
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- Algorithms for Scheduling Independent Tasks
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Bounds for LPT Schedules on Uniform Processors
- Task Scheduling on a Multiprocessor System with Independent Memories
- A Level Algorithm for Preemptive Scheduling
- An Application of Bin-Packing to Multiprocessor Scheduling
- Worst Case Analysis of Two Scheduling Algorithms
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
