Linear programming based algorithms for preemptive and non-preemptive RCPSP (Q884023): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066447358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight LP bounds for resource constrained project scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Représentation de familles ordonnées d'intervalles et applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear programming and constraint propagation-based lower bound for the RCPSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient optimal solution procedure for the preemptive 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: An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Project Scheduling Problems by Minimum Cut Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relation between multiprocessor scheduling and linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive scheduling on a fixed number of identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constraints for preemptive job-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the resource-constrained project scheduling problem / rank
 
Normal rank

Revision as of 20:05, 25 June 2024

scientific article
Language Label Description Also known as
English
Linear programming based algorithms for preemptive and non-preemptive RCPSP
scientific article

    Statements

    Linear programming based algorithms for preemptive and non-preemptive RCPSP (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2007
    0 references
    scheduling
    0 references
    resource constrained project
    0 references
    preemption
    0 references
    linear programming
    0 references
    column generation
    0 references

    Identifiers