Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs

DOI10.1051/ro/1982160302411zbMath0491.90053OpenAlexW2224313841MaRDI QIDQ3953549

Abdelkader Lahrichi

Publication date: 1982

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

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

zbMATH Keywords

minimaxexact solutionenvelopeheuristic methodcumulative schedulingcompletion time as main criteriumcompulsory parts

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (11)

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 ⋮ A preemptive bound for the resource constrained project scheduling problem ⋮ Lower bounds for the event scheduling problem with consumption and production of resources ⋮ On linear lower bounds for the resource constrained project scheduling problem. ⋮ Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions ⋮ An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan 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 ⋮ Jackson's semi-preemptive scheduling on a single machine

This page was built for publication: Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs