1. Two-stage hybrid flowshop scheduling problem;Gupta;Operational Research Society,1988
2. J.A. Hoogeveen, J.K. Lenstra, B. Veltman, Minimizing the makespan in a multiprocessor flowshop is strongly NP-Hard, European Journal of Operational Research (to appear)
3. A. Vignier, J.-C. Billaut, C. Proust, Les problèmes d'ordonnancement de type flow-shop hybride: état de l'art, in: Journées d'études: “Affectation et Ordonnancement”, CNRS/GdR Automatique/Pôle SED/GT3, pp. 7–47, Tours, September 1995 CNRS/GdR Automatique/pôle SED/GT3. To appear in RAIRO-RO/Op. Res.
4. Branch and bound algorithm for the flow shop with multiple processors;Brah;European Journal of Operations Research,1991
5. A multi-stage parallel processor flowshop problem with minimum flowtime;Rajendran;European Journal of Operational Research,1992