Un domaine très ouvert : les problèmes d'ordonnancement
From MaRDI portal
Publication:3958257
DOI10.1051/ro/1982160301751zbMath0494.90040MaRDI QIDQ3958257
Jacques Carlier, Philippe Chrétienne
Publication date: 1982
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104810
survey; project scheduling; scheduling; algorithmic complexity; exact methods; probabilistic models; approximate methods; job-shop problems; bounds derivation
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
FRACTALIZATION OF BASIN BOUNDARY IN TWO-DIMENSIONAL NONINVERTIBLE MAPS, ON CRITICAL CURVES IN TWO-DIMENSIONAL ENDOMORPHISMS, Consonant approximations of belief functions, Tabu search algorithms for cyclic machine scheduling problems, A general model for cyclic machine scheduling problems, When upper probabilities are possibility measures, The complexity of a cyclic scheduling problem with identical machines and precedence constraints, Integration of the human operator into responsive discrete production management systems, Study of a NP-hard cyclic scheduling problem: The recurrent job-shop, A study of the cyclic scheduling problem on parallel processors, Weak-order extensions of an order., Periodic scheduling of marked graphs using balanced binary words
