Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem (Q1129955): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3468865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving resource-constrained project scheduling problems by a* search / 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: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of project networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling. Exact methods for the multi-mode case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(93)e0294-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061483747 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:16, 30 July 2024

scientific article
Language Label Description Also known as
English
Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
scientific article

    Statements

    Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    16 August 1998
    0 references
    branch-and-bound
    0 references
    resource-constrained project scheduling
    0 references
    disjunctive arc concept
    0 references

    Identifiers