References

[leonlan]

Just a list of relevant references for this work:

• Dauzère-Pérès, S., Ding, J., Shen, L., & Tamssaouet, K. (2023). The flexible job shop scheduling problem: A review. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2023.05.017
• Tamssaouet, K., & Dauzère-Pérès, S. (2023). A General Efficient Neighborhood Structure Framework for the Job-Shop and Flexible Job-Shop Scheduling Problems. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2023.05.018
• Framinan, J. M., Perez-Gonzalez, P., & Fernandez-Viagas, V. (2019). Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. European Journal of Operational Research, 273(2), 401–417. https://doi.org/10.1016/j.ejor.2018.04.033
• Da Col, G., & Teppan, E. C. (2022). Industrial-size job shop scheduling with constraint programming. Operations Research Perspectives, 9, 100249. https://doi.org/10.1016/j.orp.2022.100249
• Xiong, H., Shi, S., Ren, D., & Hu, J. (2022). A survey of job shop scheduling problem: The types and models. Computers & Operations Research, 142, 105731. https://doi.org/10.1016/j.cor.2022.105731

[leonlan]

https://www.localsolver.com/benchmark/localsolver-vs-gurobi-flexible-job-shop-scheduling-problem-fjsp#footnote-9

[leonlan]

Unrelated parallel machine scheduling

• Auxilliary resources
• Sequence-dependent setup time
• Machine-dependent setup time
• Maximize the number of products completed before the end of a given time horizon
• Minimize the weighted sum of completion times
• Minimize the number of auxilliary resource moves

[leonlan]

Closing this becuase no longer relevant (use manuscript as reference source).