Preemptive scheduling of equal-length jobs in polynomial time (Q626963): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean flow time scheduling problems with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling of equal-length jobs to maximize weighted throughput. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for single-machine problems with positive finish-start time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling identical jobs on uniform parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal-length jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling to minimize mean weighted flow time / rank
 
Normal rank

Revision as of 18:38, 3 July 2024

scientific article
Language Label Description Also known as
English
Preemptive scheduling of equal-length jobs in polynomial time
scientific article

    Statements

    Preemptive scheduling of equal-length jobs in polynomial time (English)
    0 references
    0 references
    0 references
    19 February 2011
    0 references
    machine scheduling
    0 references
    preemptive scheduling
    0 references
    equal-length jobs
    0 references
    parameterized algorithm
    0 references
    polynomial algorithm
    0 references

    Identifiers