Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources (Q278540): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of shop-scheduling problems with three jobs / rank
 
Normal rank

Latest revision as of 22:30, 11 July 2024

scientific article
Language Label Description Also known as
English
Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
scientific article

    Statements

    Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources (English)
    0 references
    2 May 2016
    0 references
    project scheduling
    0 references
    nonaccumulative resources
    0 references
    dynamic programming
    0 references
    polynomial solvability
    0 references
    pseudo-polynomial solvability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references