Benchmark instances about fjsplib HOT 7 OPEN

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.

from fjsplib.

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.

from fjsplib.

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

from fjsplib.

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

from fjsplib.

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

from fjsplib.

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

from fjsplib.

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

from fjsplib.