A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q922286): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q671938
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Eugene L. Lawler / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times / 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: Q4099215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02248588 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081954069 / rank
 
Normal rank

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
scientific article

    Statements

    A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (English)
    0 references
    1990
    0 references
    polynomial algorithm
    0 references
    due dates
    0 references
    single machine
    0 references
    sum of the weights of the late jobs
    0 references
    Time and space bounds
    0 references
    pseudopolynomial time bound
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references