Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
From MaRDI portal
Publication:3953549
DOI10.1051/ro/1982160302411zbMath0491.90053MaRDI QIDQ3953549
Publication date: 1982
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104812
minimax; exact solution; envelope; heuristic method; cumulative scheduling; completion time as main criterium; compulsory parts
65K05: Numerical mathematical programming methods
90B35: Deterministic scheduling theory in operations research
Related Items
A preemptive bound for the resource constrained project scheduling problem, Energetic reasoning revisited: Application to parallel machine scheduling, Computing redundant resources for the resource constrained project scheduling problem, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem, Jackson's semi-preemptive scheduling on a single machine, On linear lower bounds for the resource constrained project scheduling problem., Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem, Optimal parallel machines scheduling with availability constraints