Benchmark instances

[leonlan]

FJSPLIB
https://people.idsia.ch/~monaldo/fjsp.html#ProblemInstances

New instances (?)
https://github.com/ai-for-decision-making-tue/Job_Shop_Scheduling_Benchmark_Environments_and_Instances

https://github.com/SchedulingLab/fjsp-instances

---

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

• Job shop instances

• Related: https://github.com/wsgisler/job-shop-scheduling

• https://github.com/SchedulingLab/jsp-instances

---

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

contains an overview of benchmark instances.

There are several sets of FJSP benchmark instances that are widely used in the literature:
34 BRdata (Brandimarte, 1993), HUdata (Hurink et al., 1994), BCdata (Barnes and Chambers,
35 1996), DPdata (Dauzere-P ́eres and Paulli, 1997), DMUdata (Demirkol et al., 1998), KCdata
36 (Kacem et al., 2002a), Fdata (Fattahi et al., 2007), DAdata (Birgin et al., 2015), as well as
37 Ydata (Birgin et al., 2015), leading to a total of 467 instances of different sizes and with
38 different flexibility levels.

---

Test Instances for the Flexible Job Shop Scheduling Problem with Work Centers
Dennis Behnke1,∗ and Martin Josef Geiger1

also contains a benchmark set.

---

Lunadi 2020: online color printing instances
https://github.com/Willtl/online-printing-shop/tree/master

• Should be easy to solve this type of model.

---

Naderi, B., & Roshanaei, V. (2022). Critical-Path-Search Logic-Based Benders Decomposition Approaches for Flexible Job Shop Scheduling. INFORMS Journal on Optimization, 4(1), 1–28. https://doi.org/10.1287/ijoo.2021.0056

• New hard FJSP instances. Cant find the instances directly from the paper, but I know that Naderi et al. (2023) has them,

---

Morais, R., Bulhões, T., & Subramanian, A. (2023). Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2023.11.024

• 1800 instances for single machine with SDST and release dates: https://github.com/rsobralm/SMRDSDST/tree/main
• Instances should be attributed to Ovacikt, I. M., & Uzsoy, R. (1994). Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. International Journal of Production Research, 32(6), 1243–1263. https://doi.org/10.1080/00207549408956998
  • What's strange about these instances is that they include information about the number of machines but they're only used to create single machine instances.

[leonlan]

The paper

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

introduces a benchmark set.

[leonlan]

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

contains an overview of benchmark instances.

[leonlan]

Currently parsing the instances from https://github.com/ai-for-decision-making-tue/Job_Shop_Scheduling_Benchmark_Environments_and_Instances/tree/main/data.

• jsp
• fjsp
• fjsp_sdst
• fajsp
  • The yfjs and dafjs instances don't adhere to the same format. The former has jobs whereas the latter does not.
  • Ok, so the yfjs instances are nice to have for benchmarking. So we should parse this too. My suggestion is to redefine the format (in terms of the classical FJSP format).
• Ignoring fsp/vrf. I can't really be bothered to deal with the yfjs instances.
• Introduce precedence relationships.

---

• Ok done. Now I have to convert these into ProblemDataModel instances.
• Added Benhke 2012 FJSP instances.
• Solved the first Behnke FJSP instance.
• Next: check if all instances can be "ran".
  • fjsp
  • jsp
  • fjsp_sdst
  • fasjp

---

Cool, everything works. Most instances are too simple and solved optimally within less than one minute. That's not interesting. But there are a lot of new instances that we should add:

• Naderi (2022) for FJSP
• Birgin (2014) yData --> requires different format
• Da Col (2022) JSP ignored for now
• Lunardi (2022) general FJSP (low prior) ignored for now

[leonlan]

There are some more FJSP with assembly instances here: https://github.com/snt-robotics/fjsp_fcr

Kasapidis, G. A., Dauzère-Pérès, S., Paraskevopoulos, D. C., Repoussis, P. P., & Tarantilis, C. D. (2023). On the multiresource flexible job-shop scheduling problem with arbitrary precedence graphs. Production and Operations Management, 32(7), 2322–2330. https://doi.org/10.1111/poms.13977

• This one uses Dauzere-Perez 1998 instances
• https://github.com/gkasapidis/RCFJSSP

Kasapidis, G. A., Paraskevopoulos, D. C., Repoussis, P. P., & Tarantilis, C. D. (2021). Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs. Production and Operations Management, 30(11), 4044–4068. https://doi.org/10.1111/poms.13501

• https://github.com/gkasapidis/CPG-FJSSP

• https://github.com/gregkwaste/FJSSP_CPC_Generator

[leonlan]

Berterottière, L., Dauzère-Pérès, S., & Yugma, C. (2024). Flexible job-shop scheduling with transportation resources. European Journal of Operational Research, 312(3), 890–909. https://doi.org/10.1016/j.ejor.2023.07.036

• https://github.com/lucasberter/FJSPT

[leonlan]

• Maybe PSPLIb? https://www.om-db.wi.tum.de/psplib/library.html

[leonlan]

https://github.com/ScheduleOpt/benchmarks lots of instances here

[leonlan]

https://grupo.us.es/oindustrial/en/research/results/ here too

[leonlan]

• https://ptal.github.io/scheduling-data.html overview of main instances
• with parsers https://github.com/ptal/kobe/tree/master/src/kobe/parsers/scheduling

relevant for PSPLIB