Baptiste, P.; Cho, C. H.; Favrel, J.; Zouhri, M. Une caractérisation analytique des ordonnancements admissibles sous contraintes hétérogènes en “flow-shop”. (An analytic characterization of feasible schedules under heterogeneous constraints in flow-shop scheduling). (French) Zbl 0726.90034 RAIRO, Autom. Prod. Inf. Ind. 25, No. 1, 87-102 (1991). Summary: This article deals with scheduling problems under potential and set constraints. A data structure called a P-Q-R tree is introduced to be used to represent all feasible solutions under those constraints. We specify the P-Q-R tree structure and present a new form to assure a unique representation for given constraints routines. MSC: 90B35 Deterministic scheduling theory in operations research Keywords:flow-shop scheduling; potential and set constraints; P-Q-R tree PDF BibTeX XML Cite \textit{P. Baptiste} et al., RAIRO, Autom. Prod. Inf. Ind. 25, No. 1, 87--102 (1991; Zbl 0726.90034) OpenURL