Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling (Q2883566): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/j.endm.2010.05.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082383217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / 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: Solving Project Scheduling Problems by Minimum Cut Computations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:24, 5 July 2024

scientific article
Language Label Description Also known as
English
Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
scientific article

    Statements

    Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    modulo scheduling
    0 references
    resource constraints
    0 references
    minimum period
    0 references
    Lagrangian relaxation
    0 references

    Identifiers