Un domaine très ouvert : les problèmes d'ordonnancement

DOI10.1051/ro/1982160301751zbMath0494.90040OpenAlexW2586265665MaRDI QIDQ3958257

Philippe Chrétienne, Jacques Carlier

Publication date: 1982

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

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

zbMATH Keywords

surveyproject schedulingschedulingalgorithmic complexityexact methodsprobabilistic modelsapproximate methodsjob-shop problemsbounds derivation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (12)

A study of the cyclic scheduling problem on parallel processors ⋮ Tabu search algorithms for cyclic machine scheduling problems ⋮ Weak-order extensions of an order. ⋮ When upper probabilities are possibility measures ⋮ A general model for cyclic machine scheduling problems ⋮ Periodic scheduling of marked graphs using balanced binary words ⋮ Consonant approximations of belief functions ⋮ FRACTALIZATION OF BASIN BOUNDARY IN TWO-DIMENSIONAL NONINVERTIBLE MAPS ⋮ ON CRITICAL CURVES IN TWO-DIMENSIONAL ENDOMORPHISMS ⋮ 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

This page was built for publication: Un domaine très ouvert : les problèmes d'ordonnancement