Article
BLAST: Bottleneck-Free Large-Scale Algorithm Scheduling Throughput A Streamlined Approach to the Flexible Job Shop Problem (FJSP)
2026-06-02
Abstract excerpt
<title>Abstract</title> <p>The Flexible Job Shop Scheduling Problem (FJSP) is an NP-Hard problem for task sequencing and resource allocation that poses a computational challenge universally across scientific disciplines and industries that need optimal and fast, high-throughput schedules. The impact of FJSP scheduling solutions is deeply embedded in manufacturing and logistics, genomics and sequencing, astronomy...
Topics
Open a Topic to create a Post that cites this publication.
Identifiers and source
- Literature Corpus work
- bdc53de4-2725-512f-aac0-c426b830fc1c
- DOI
- 10.21203/rs.3.rs-9871887/v1
