no. 1
An exact method for solving the multi-processor flow-shop
RAIRO - Operations Research - Recherche Opérationnelle, Tome 34 (2000) no. 1, pp. 1-25. 
@article{RO_2000__34_1_1_0,
     author = {Carlier, Jacques and N\'eron, Emmanuel},
     title = {An exact method for solving the multi-processor flow-shop},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {1--25},
     publisher = {EDP-Sciences},
     volume = {34},
     number = {1},
     year = {2000},
     mrnumber = {1747708},
     zbl = {0963.90027},
     language = {en},
     url = {http://www.numdam.org/item/RO_2000__34_1_1_0/}
}
TY  - JOUR
AU  - Carlier, Jacques
AU  - Néron, Emmanuel
TI  - An exact method for solving the multi-processor flow-shop
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2000
SP  - 1
EP  - 25
VL  - 34
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_2000__34_1_1_0/
LA  - en
ID  - RO_2000__34_1_1_0
ER  - 
%0 Journal Article
%A Carlier, Jacques
%A Néron, Emmanuel
%T An exact method for solving the multi-processor flow-shop
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2000
%P 1-25
%V 34
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/RO_2000__34_1_1_0/
%G en
%F RO_2000__34_1_1_0
Carlier, Jacques; Néron, Emmanuel. An exact method for solving the multi-processor flow-shop. RAIRO - Operations Research - Recherche Opérationnelle, Tome 34 (2000) no. 1, pp. 1-25. http://www.numdam.org/item/RO_2000__34_1_1_0/

[Baptiste et al., 98] P. Baptiste, C. Le Pape and W. Nuijten, Satisfiability tests and time-bound adjustments for cumulative scheduling problems, Technical Report 98-97, Université de Technologie de Compiègne, to appear in Ann. Oper. Res. | MR | Zbl

[Brah and Hunsucker, 91] S. A. Brah and J. L. Hunsucker, Branch and bound method for the flow shop with multiple processors. European J. Oper. Res., 1991, 51, p. 88-89. | Zbl

[Carlier, 84] J. Carlier, Problèmes d'ordonnancement à contraintes de ressources: algorithmes et complexité, Thèse d'État, MASI. 1984.

[Carlier and Pinson, 98] J. Carlier and E. Pinson, Jackson pseudo preemptive schedule for the Pm/ri, qi/Cmax problem, Ann. Oper. Res., 1998, 83, p. 41-58. | MR | Zbl

[Demeulemeester and Herroelen, 92] E. L. Demeulemeester and W. S. Herroelen, A Branch and Bound procedure for the multiple resource-constrained project scheduling problem, Management Science, 1992, 38, p. 1803-1818. | Zbl

[Gupta, 88] J. N. D. Gupta, Two stages hybril flowshop scheduling problem, Operational Research Society, 1988, 4, p. 359-364.

[Perregaard, 95] M. Perregaard, Branch and bound methods for the multiprocessor jobshop and flowshop scheduling problems, Datalogisk Institut Kobenhavns Universitet - Master Thesis, 1995.

[Portmann et al, 98] M. C. Portmann, A. Vignier, D. Dardilhac and D. Dezalay, Branch and bound crossed with G.A to solve hybrid flowshops, European J. Oper. Res., 1998, 107, p. 339-400. | Zbl

[Sprecher, 94] A. Sprecher, Resource-Constrained Project Scheduling - Exact Methods for the Multi-Mode case, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, 1994. | MR | Zbl

[Vandevelde, 94] A. Vandevelde, Minimizing the makespan in a multiprocessor flow shop, Eindhoven University of Technology - Master Thesis, 1994.

[Vignier, 97] A. Vignier, Contribution à la résolution des problèmes d'ordonnancement de type monogamme, multimachines ("flow-shop hybride"), PhD Thesis, 1997.