1. Garey, M.R., Johnson, D.S., Seth, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117–129 (1976)
2. Roy, B., Sussmann, B.: Les problèmes d’ordonnancement avec contraintes disjunctives. In: Note DS N°9 bis. SEMA, Paris (1964)
3. Cheng, A., Gen, M., Tsumjimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms – representations. Comput. Ind. Eng. 30(4), 983–997 (1996)
4. Bourreau, E., Fleury, G., Lacomme, P.: Indirect quantum approximate optimization algorithms: application to the TSP (2023). arXiv:2311.03294
5. Knuth, D.: The Art of Computer Programming - Volume 3. Sorting and Searching. 2nd edn. Addison-Wesley, Reading (1981)