BLAST: Bottleneck-Free Large-Scale Algorithm Scheduling Throughput A Streamlined Approach to the Flexible Job Shop Problem (FJSP)

Gaby Abou Haidar, Wissam Nakhle, Jawad Nakhle, Roger Achkar

Open source

DOI
10.21203/rs.3.rs-9871887/v1
Published
2026-06-02
Container
Not recorded
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 60/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.21203/rs.3.rs-9871887/v1,
  title = {BLAST: Bottleneck-Free Large-Scale Algorithm Scheduling Throughput A Streamlined Approach to the Flexible Job Shop Problem (FJSP)},
  author = {Gaby Abou Haidar and Wissam Nakhle and Jawad Nakhle and Roger Achkar},
  year = {2026},
  doi = {10.21203/rs.3.rs-9871887/v1},
  url = {https://doi.org/10.21203/rs.3.rs-9871887/v1}
}

RIS

TY  - JOUR
TI  - BLAST: Bottleneck-Free Large-Scale Algorithm Scheduling Throughput A Streamlined Approach to the Flexible Job Shop Problem (FJSP)
AU  - Gaby Abou Haidar
AU  - Wissam Nakhle
AU  - Jawad Nakhle
AU  - Roger Achkar
PY  - 2026
DO  - 10.21203/rs.3.rs-9871887/v1
UR  - https://doi.org/10.21203/rs.3.rs-9871887/v1
ER  - 

APA

Haidar, G. A., Nakhle, W., Nakhle, J., & Achkar, R. (2026). BLAST: Bottleneck-Free Large-Scale Algorithm Scheduling Throughput A Streamlined Approach to the Flexible Job Shop Problem (FJSP). https://doi.org/10.21203/rs.3.rs-9871887/v1

Source records