On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q280157): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00291-015-0419-6 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q59389548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3468865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resource-constrained project scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-mode resource-constrained project scheduling problem with generalized precedence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Erraticism in Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of variants and extensions of the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Boolean satisfiability approach to the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPLIB -- a project scheduling problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation via lazy clause generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explaining the \texttt{cumulative} propagator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving RCPSP/max by lazy clause generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00291-015-0419-6 / rank
 
Normal rank

Latest revision as of 13:21, 9 December 2024

scientific article
Language Label Description Also known as
English
On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
scientific article

    Statements

    On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2016
    0 references
    project scheduling
    0 references
    constraint programming
    0 references
    multi-mode
    0 references
    generalized precedence relations
    0 references
    SAT solving
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers