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

DOI10.1051/ro/1982160302411zbMath0491.90053MaRDI 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

minimax; exact solution; envelope; heuristic method; cumulative scheduling; completion time as main criterium; compulsory parts

Mathematics Subject Classification ID

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., Lower bounds for the event scheduling problem with consumption and production of resources, 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