mlsanityData to 14 Oct 2026

Job Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods

arXiv 2308.12794 ↗First posted 24 Aug 2023cs.AI cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

Job shop scheduling problems address the routing and sequencing of tasks in a job shop setting. Despite significant interest from operations research and machine learning communities over the years, a comprehensive platform for testing and comparing solution methods has been notably lacking. To fill this gap, we introduce a unified implementation of job shop scheduling problems and their solution methods, addressing the long-standing need for a standardized benchmarking platform in this domain. Our platform supports classic Job Shop (JSP), Flow Shop (FSP), Flexible Job Shop (FJSP), and Assembly Job Shop (AJSP), as well as variants featuring Sequence-Dependent Setup Times (SDST), variants with online arrivals of jobs, and combinations of these problems (e.g., FJSP-SDST and FAJSP). The platfrom provides a wide range of scheduling solution methods, from heuristics, metaheuristics, and exact optimization to deep reinforcement learning. The implementation is available as an open-source GitHub repository, serving as a collaborative hub for researchers, practitioners, and those new to the field. Beyond enabling direct comparisons with existing methods on widely studied benchmark problems, this resource serves as a robust starting point for addressing constrained and complex problem variants. By establishing a comprehensive and unified foundation, this platform is designed to consolidate existing knowledge and to inspire the development of next-generation algorithms in job shop scheduling research.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 3 of its 39 references that are in the map. First posted on arXiv 24 Aug 2023.

Builds on

3 of 39 references.

References · 3

  1. 2020Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learningcited by 140
  2. 2014A MILP model for an extended version of the Flexible Job Shop Problemcited by 5
  3. 2023schlably: A Python Framework for Deep Reinforcement Learning Based Scheduling Experimentscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 5; 2026: 4.

12 papers.

  1. 2025Large Language Models as End-to-end Combinatorial Optimization Solverscited by 28
  2. 2024Graph Neural Networks for Job Shop Scheduling Problems: A Surveycited by 15
  3. 2024Offline Reinforcement Learning for Learning to Dispatch for Job Shop Schedulingcited by 6
  4. 2025A Production Scheduling Framework for Reinforcement Learning Under Real-World Constraintscited by 2
  5. 2024Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problemscited by 1
  6. 2025Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimizationcited by 0
  7. 2025Generalizing Beyond Suboptimality: Offline Reinforcement Learning Learns Effective Scheduling through Random Solutionscited by 0
  8. 2025Algorithms for dynamic scheduling in manufacturing, towards digital factories Improving Deadline Feasibility and Responsiveness via Temporal Networkscited by 0
  9. 2026Scheduling That Speaks: An Interpretable Programmatic Reinforcement Learning Frameworkcited by 0
  10. 2026A Sliding-Window-Based Reinforcement Learning for Dynamic Assembly Flow Shop Scheduling with Multi-Product Deliverycited by 0
  11. 2026VLM Fine-Tuning for End-to-End Combinatorial Optimizationcited by 0
  12. 2026Multi-Task Evolution for Zero-Shot Cross-Problem Generalization using LLMscited by 0