Une méthode arborescente pour résoudre les problèmes cumulatifs

DOI10.1051/ro/1991250303111zbMath0733.90036OpenAlexW62761189MaRDI QIDQ3360656

Jacques Carlier, Bruno Latapie

Publication date: 1991

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105017

zbMATH Keywords

project schedulingbranch and boundNP-hardnessresource constraintsminimal makespanprecedence and cumulative constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem, Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions, An exact composite lower bound strategy for the resource-constrained project scheduling problem, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem, An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case, A hybrid exact method for a scheduling problem with a continuous resource and energy constraints, A preemptive bound for the resource constrained project scheduling problem, On linear lower bounds for the resource constrained project scheduling problem., Resource-constrained project scheduling: A survey of recent developments., An approximate decomposition algorithm for scheduling on parallel machines with heads and tails, An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem, Methods to solve multi-skill project scheduling problem, Branch-and-price approach for the multi-skill project scheduling problem, Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem, Jackson's pseudo-preemptive schedule and cumulative scheduling problems, Optimal parallel machines scheduling with availability constraints, A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem, Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, A branch and bound algorithm for the resource-constrained project scheduling problem, Two deadline reduction algorithms for scheduling dependent tasks on parallel processors