Fast approximation algorithm for job sequencing with deadlines (Q1154384): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4090116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888846 / 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: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(81)90008-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065104488 / rank
 
Normal rank

Latest revision as of 10:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Fast approximation algorithm for job sequencing with deadlines
scientific article

    Statements

    Fast approximation algorithm for job sequencing with deadlines (English)
    0 references
    0 references
    0 references
    1981
    0 references
    fast approximation algorithm
    0 references
    job sequencing
    0 references
    deadlines
    0 references
    range-and-bound method
    0 references
    minimization of delay penalties
    0 references
    polynomial epsilon-approximation algorithm
    0 references

    Identifiers