Méthodes de décomposition spatiale et temporelle en ordonnancement de la production. (French) Zbl 0647.90046

Summary: The scheduling problem is NP-hard. It is then impossible to obtain an optimal solution satisfyng the real time constraint. So, people usually use heuristic algorithms and obtain a “good” solution instead of an optimal one. This paper proposes heuristic algorithms for minimizing tardiness in a job-shop. Spatial and temporal decompositions are described and tested using numerical examples.


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