Approximation scheduling algorithms: a survey (Q4207781): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331938908843507 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065029766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the Open Shop to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A vector-sum theorem in two-dimensional space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Tasks on Unrelated Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Independent Tasks on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multifit Scheduling on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multiprocessor Scheduling with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained scheduling as generalized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Tasks with Nonuniform Deadlines on Two Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for LPT Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for naive multiple machine scheduling with release times and deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Preemptive Multiprocessor Job Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Task Scheduling on a Multiprocessor System with Independent Memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First fit decreasing scheduling on uniform multiprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst Case Analysis of Two Scheduling Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on list scheduling of UET tasks with restricted resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with limited temporary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non deterministic polynomial optimization problems and their approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a linear programming heuristic for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank

Latest revision as of 11:03, 20 June 2024

scientific article; zbMATH DE number 4128651
Language Label Description Also known as
English
Approximation scheduling algorithms: a survey
scientific article; zbMATH DE number 4128651

    Statements

    Approximation scheduling algorithms: a survey (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    survey
    0 references
    approximation scheduling
    0 references
    polynomial time complexity
    0 references
    extensive bibliography
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers