Solving the resource constrained deadline scheduling problem via reduction to the network flow problem (Q1147628): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jacek Błażewicz / rank
Normal rank
 
Property / author
 
Property / author: Jacek Błażewicz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(81)90331-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114366376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4136574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple algorithms for multiprocessor scheduling to meet deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deadline scheduling of tasks with ready times and resource constraints / 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: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow with Gains through a Special Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum lateness on one machine: computational experience and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:06, 13 June 2024

scientific article
Language Label Description Also known as
English
Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
scientific article

    Statements

    Solving the resource constrained deadline scheduling problem via reduction to the network flow problem (English)
    0 references
    1981
    0 references
    resource constrained deadline scheduling problem
    0 references
    reduction
    0 references
    network flow problem
    0 references
    maximal flow
    0 references
    binary network
    0 references
    NP-complete problems
    0 references
    computational complexity
    0 references
    0 references

    Identifiers

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