{"url":"/task/job-shop-scheduling","name":"Job Shop Scheduling","slug":"job-shop-scheduling","description_markdown":"Scheduling Task","categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":92,"papers_with_code":35,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":35,"tagged_in_all":92,"items":[{"url":"/paper/a-reinforcement-learning-environment-for-job","title":"A Reinforcement Learning Environment For Job-Shop Scheduling","date":"2021-04-08","arxiv_id":"2104.03760","repositories_listed":4,"syntology":null},{"url":"/paper/learning-to-dispatch-for-job-shop-scheduling","title":"Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning","date":"2020-10-23","arxiv_id":"2010.12367","repositories_listed":4,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/boosting-binary-optimization-via-binary","title":"Boosting Binary Optimization via Binary Classification: A Case Study of Job Shop Scheduling","date":"2018-08-31","arxiv_id":"1808.10813","repositories_listed":2,"syntology":null},{"url":"/paper/a-production-scheduling-framework-for","title":"A Production Scheduling Framework for Reinforcement Learning Under Real-World Constraints","date":"2025-06-16","arxiv_id":"2506.13566","repositories_listed":1,"syntology":null},{"url":"/paper/solving-the-job-shop-scheduling-problem-with-1","title":"Solving the Job Shop Scheduling Problem with Graph Neural Networks: A Customizable Reinforcement Learning Environment","date":"2025-06-10","arxiv_id":"2506.13781","repositories_listed":1,"syntology":null},{"url":"/paper/unraveling-the-rainbow-can-value-based","title":"Unraveling the Rainbow: can value-based methods schedule?","date":"2025-05-06","arxiv_id":"2505.03323","repositories_listed":1,"syntology":null},{"url":"/paper/starjob-dataset-for-llm-driven-job-shop","title":"Starjob: Dataset for LLM-Driven Job Shop Scheduling","date":"2025-02-26","arxiv_id":"2503.01877","repositories_listed":1,"syntology":null},{"url":"/paper/learning-guided-rolling-horizon-optimization","title":"Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Scheduling","date":"2025-02-18","arxiv_id":"2502.15791","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":4}},{"url":"/paper/neural-combinatorial-optimization-for","title":"Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems","date":"2024-12-18","arxiv_id":"2412.14052","repositories_listed":1,"syntology":null},{"url":"/paper/offline-reinforcement-learning-for-learning","title":"Offline Reinforcement Learning for Learning to Dispatch for Job Shop Scheduling","date":"2024-09-16","arxiv_id":"2409.10589","repositories_listed":1,"syntology":null},{"url":"/paper/llms-can-schedule","title":"LLMs can Schedule","date":"2024-08-13","arxiv_id":"2408.06993","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_unverified":1,"n_pointer_only":7}},{"url":"/paper/take-a-step-and-reconsider-sequence-decoding","title":"Take a Step and Reconsider: Sequence Decoding for Self-Improved Neural Combinatorial Optimization","date":"2024-07-24","arxiv_id":"2407.17206","repositories_listed":1,"syntology":null},{"url":"/paper/self-improvement-for-neural-combinatorial","title":"Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvement","date":"2024-03-22","arxiv_id":"2403.15180","repositories_listed":1,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/learning-to-solve-job-shop-scheduling-under","title":"Learning to Solve Job Shop Scheduling under Uncertainty","date":"2024-03-04","arxiv_id":"2404.01308","repositories_listed":1,"syntology":null},{"url":"/paper/learning-topological-representations-with","title":"Learning Topological Representations with Bidirectional Graph Attention Network for Solving Job Shop Scheduling Problem","date":"2024-02-27","arxiv_id":"2402.17606","repositories_listed":1,"syntology":null},{"url":"/paper/self-labeling-the-job-shop-scheduling-problem","title":"Self-Labeling the Job Shop Scheduling Problem","date":"2024-01-22","arxiv_id":"2401.11849","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":2}},{"url":"/paper/combinatorial-optimization-with-policy","title":"Combinatorial Optimization with Policy Adaptation using Latent Space Search","date":"2023-11-13","arxiv_id":"2311.13569","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_unverified":2,"n_pointer_only":7}},{"url":"/paper/job-shop-scheduling-benchmark-environments","title":"Job Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods","date":"2023-08-24","arxiv_id":"2308.12794","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/job-shop-scheduling-via-deep-reinforcement","title":"Job Shop Scheduling via Deep Reinforcement Learning: a Sequence to Sequence approach","date":"2023-08-03","arxiv_id":"2308.01797","repositories_listed":1,"syntology":null},{"url":"/paper/an-end-to-end-reinforcement-learning-approach","title":"An End-to-End Reinforcement Learning Approach for Job-Shop Scheduling Problems Based on Constraint Programming","date":"2023-06-09","arxiv_id":"2306.05747","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/policy-based-self-competition-for-planning","title":"Policy-Based Self-Competition for Planning Problems","date":"2023-06-07","arxiv_id":"2306.04403","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-job-shop-scheduling-via-dual","title":"Flexible Job Shop Scheduling via Dual Attention Network Based Reinforcement Learning","date":"2023-05-09","arxiv_id":"2305.05119","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-distributional-shifts-in","title":"Addressing distributional shifts in operations management: The case of order fulfillment in customized production","date":"2023-04-24","arxiv_id":"2304.11910","repositories_listed":1,"syntology":null},{"url":"/paper/schlably-a-python-framework-for-deep","title":"schlably: A Python Framework for Deep Reinforcement Learning Based Scheduling Experiments","date":"2023-01-10","arxiv_id":"2301.04182","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-search-for-job-shop-scheduling","title":"Deep Reinforcement Learning Guided Improvement Heuristic for Job Shop Scheduling","date":"2022-11-20","arxiv_id":"2211.10936","repositories_listed":1,"syntology":null},{"url":"/paper/winner-takes-it-all-training-performant-rl-1","title":"Winner Takes It All: Training Performant RL Populations for Combinatorial Optimization","date":"2022-10-07","arxiv_id":"2210.03475","repositories_listed":1,"syntology":{"n":8,"n_ran":0,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/learning-to-generalize-dispatching-rules-on","title":"Learning to generalize Dispatching rules on the Job Shop Scheduling","date":"2022-06-09","arxiv_id":"2206.04423","repositories_listed":1,"syntology":null},{"url":"/paper/problem-decomposition-and-multi-shot-asp","title":"Decomposition Strategies and Multi-shot ASP Solving for Job-shop Scheduling","date":"2022-05-16","arxiv_id":"2205.07537","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-intelligence-for-dynamic-job-shop","title":"Hybrid intelligence for dynamic job-shop scheduling with deep reinforcement learning and attention mechanism","date":"2022-01-03","arxiv_id":"2201.00548","repositories_listed":1,"syntology":null},{"url":"/paper/an-actor-critic-algorithm-with-deep-double","title":"An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents","date":"2021-10-18","arxiv_id":"2110.09076","repositories_listed":1,"syntology":null}],"syntology_records":9,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}