{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":92,"of":92,"of_with_code":35,"tagged_in_all":92,"counts":{"archive_papers_tagged":92,"with_a_code_link":35,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":92,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":9,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/a-reinforcement-learning-environment-for-job","slug":"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","slug":"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":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-dispatch-for-job-shop-scheduling#ran","syntology_url":"https://syntology.ai/paper/2010.12367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12367"}},"official":{"repos":["zcajiayin/L2D"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/boosting-binary-optimization-via-binary","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-guided-rolling-horizon-optimization#ran","syntology_url":"https://syntology.ai/paper/2502.15791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.15791"}},"official":{"repos":["mit-wu-lab/l-rho"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-combinatorial-optimization-for","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/llms-can-schedule#ran","syntology_url":"https://syntology.ai/paper/2408.06993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.06993"}},"official":{"repos":["starjob42/datasetjsp"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/take-a-step-and-reconsider-sequence-decoding","slug":"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","slug":"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":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":2,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 2 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-improvement-for-neural-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2403.15180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15180"}},"official":{"repos":["grimmlab/gumbeldore"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-solve-job-shop-scheduling-under","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/self-labeling-the-job-shop-scheduling-problem#ran","syntology_url":"https://syntology.ai/paper/2401.11849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11849"}},"official":{"repos":["andreacorsini1/selflabelingjobshop"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/combinatorial-optimization-with-policy","slug":"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_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/combinatorial-optimization-with-policy#ran","syntology_url":"https://syntology.ai/paper/2311.13569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.13569"}},"official":{"repos":["instadeepai/compass"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/job-shop-scheduling-benchmark-environments","slug":"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_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/job-shop-scheduling-benchmark-environments#ran","syntology_url":"https://syntology.ai/paper/2308.12794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12794"}},"official":{"repos":["ai-for-decision-making-tue/job_shop_scheduling_benchmark"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/job-shop-scheduling-via-deep-reinforcement","slug":"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","slug":"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":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-end-to-end-reinforcement-learning-approach#ran","syntology_url":"https://syntology.ai/paper/2306.05747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05747"}},"official":{"repos":["ingambe/End2End-Job-Shop-Scheduling-CP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/policy-based-self-competition-for-planning","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/winner-takes-it-all-training-performant-rl-1#ran","syntology_url":"https://syntology.ai/paper/2210.03475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03475"}},"official":null}},{"url":"/paper/learning-to-generalize-dispatching-rules-on","slug":"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","slug":"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","slug":"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","slug":"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},{"url":"/paper/schedulenet-learn-to-solve-multi-agent","slug":"schedulenet-learn-to-solve-multi-agent","title":"ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning","date":"2021-06-06","arxiv_id":"2106.03051","repositories_listed":1,"syntology":null},{"url":"/paper/metaheuristics-for-the-online-printing-shop","slug":"metaheuristics-for-the-online-printing-shop","title":"Metaheuristics for the Online Printing Shop Scheduling Problem","date":"2020-06-22","arxiv_id":"2006.12344","repositories_listed":1,"syntology":null},{"url":"/paper/google-vs-ibm-a-constraint-solving-challenge","slug":"google-vs-ibm-a-constraint-solving-challenge","title":"Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem","date":"2019-09-18","arxiv_id":"1909.08247","repositories_listed":1,"syntology":null},{"url":"/paper/an-ant-colony-optimization-algorithm-for-job","slug":"an-ant-colony-optimization-algorithm-for-job","title":"An ant colony optimization algorithm for job shop scheduling problem","date":"2013-09-19","arxiv_id":"1309.5110","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-bacterial-foraging-algorithm-for","slug":"a-hybrid-bacterial-foraging-algorithm-for","title":"A Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems","date":"2012-11-21","arxiv_id":"1211.4971","repositories_listed":1,"syntology":null},{"url":null,"slug":"remoh-a-reflective-evolution-of-multi","title":"REMoH: A Reflective Evolution of Multi-objective Heuristics approach via Large Language Models","date":"2025-06-09","arxiv_id":"2506.07759","repositories_listed":0,"syntology":null},{"url":null,"slug":"alas-a-stateful-multi-llm-agent-framework-for","title":"ALAS: A Stateful Multi-LLM Agent Framework for Disruption-Aware Planning","date":"2025-05-18","arxiv_id":"2505.12501","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-bias-generalized-rollout-policy","title":"Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem","date":"2025-05-13","arxiv_id":"2505.08451","repositories_listed":0,"syntology":null},{"url":"/paper/neural-combinatorial-optimization-via","slug":"neural-combinatorial-optimization-via","title":"Neural Combinatorial Optimization via Preference Optimization","date":"2025-03-10","arxiv_id":"2503.07580","repositories_listed":0,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-combinatorial-optimization-via#ran","syntology_url":"https://syntology.ai/paper/2503.07580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.07580"}},"official":null}},{"url":null,"slug":"discrete-differential-evolution-particle","title":"Discrete Differential Evolution Particle Swarm Optimization Algorithm for Energy Saving Flexible Job Shop Scheduling Problem Considering Machine Multi States","date":"2025-03-04","arxiv_id":"2503.02180","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-evaluation-for-job-shop-scheduling","title":"Self-Evaluation for Job-Shop Scheduling","date":"2025-02-12","arxiv_id":"2502.08684","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-the-monte-carlo-tree-search","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","date":"2025-01-29","arxiv_id":"2501.17991","repositories_listed":0,"syntology":null},{"url":null,"slug":"comprehensive-benchmarking-environment-for","title":"A Benchmarking Environment for Worker Flexibility in Flexible Job Shop Scheduling Problems","date":"2025-01-27","arxiv_id":"2501.16159","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-programming-via-large-language","title":"Automatic programming via large language models with population self-evolution for dynamic job shop scheduling problem","date":"2024-10-30","arxiv_id":"2410.22657","repositories_listed":0,"syntology":null},{"url":null,"slug":"offline-reinforcement-learning-for-job-shop","title":"Offline reinforcement learning for job-shop scheduling problems","date":"2024-10-21","arxiv_id":"2410.15714","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-flexible-job-shop-scheduling-problem","title":"A Flexible Job Shop Scheduling Problem Involving Reconfigurable Machine Tools Under Industry 5.0","date":"2024-10-16","arxiv_id":"2410.23302","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-history-guided-regional-partitioning","title":"A History-Guided Regional Partitioning Evolutionary Optimization for Solving the Flexible Job Shop Problem with Limited Multi-load Automated Guided Vehicles","date":"2024-09-27","arxiv_id":"2409.18742","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-job-shop-scheduling-in-the","title":"Optimizing Job Shop Scheduling in the Furniture Industry: A Reinforcement Learning Approach Considering Machine Setup, Batch Variability, and Intralogistics","date":"2024-09-18","arxiv_id":"2409.11820","repositories_listed":0,"syntology":null},{"url":null,"slug":"developing-an-algorithm-selector-for-green","title":"Developing an Algorithm Selector for Green Configuration in Scheduling Problems","date":"2024-09-13","arxiv_id":"2409.08641","repositories_listed":0,"syntology":null},{"url":null,"slug":"decision-transformer-for-enhancing-neural","title":"Decision Transformer for Enhancing Neural Local Search on the Job Shop Scheduling Problem","date":"2024-09-04","arxiv_id":"2409.02697","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-algorithm-incorporating","title":"Evolutionary algorithm incorporating reinforcement learning for energy-conscious flexible job-shop scheduling problem with transportation and setup times","date":"2024-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-for-job-shop-scheduling","title":"Graph Neural Networks for Job Shop Scheduling Problems: A Survey","date":"2024-06-20","arxiv_id":"2406.14096","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-training-optimizing-reinforcement","title":"Beyond Training: Optimizing Reinforcement Learning Based Job Shop Scheduling Through Adaptive Action Sampling","date":"2024-06-11","arxiv_id":"2406.07325","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-representation-genetic-programming-a","title":"Multi-Representation Genetic Programming: A Case Study on Tree-based and Linear Representations","date":"2024-05-23","arxiv_id":"2405.14268","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-constraint-programming-in-a-deep","title":"Leveraging Constraint Programming in a Deep Learning Approach for Dynamically Solving the Flexible Job-Shop Scheduling Problem","date":"2024-03-14","arxiv_id":"2403.09249","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-enabled-flexible-job-shop-scheduling","title":"Learning-enabled Flexible Job-shop Scheduling for Scalable Smart Manufacturing","date":"2024-02-14","arxiv_id":"2402.08979","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-based-reinforcement-learning-for-1","title":"Attention-based Reinforcement Learning for Combinatorial Optimization: Application to Job Shop Scheduling Problem","date":"2024-01-29","arxiv_id":"2401.16580","repositories_listed":0,"syntology":null},{"url":null,"slug":"introducing-petrirl-an-innovative-framework","title":"Introducing PetriRL: An Innovative Framework for JSSP Resolution Integrating Petri nets and Event-based Reinforcement Learning","date":"2024-01-23","arxiv_id":"2402.00046","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-large-flexible-job-shop-scheduling","title":"Solving the flexible job-shop scheduling problem through an enhanced deep reinforcement learning approach","date":"2023-10-24","arxiv_id":"2310.15706","repositories_listed":0,"syntology":null},{"url":null,"slug":"residual-scheduling-a-new-reinforcement","title":"Residual Scheduling: A New Reinforcement Learning Approach to Solving Job Shop Scheduling Problem","date":"2023-09-27","arxiv_id":"2309.15517","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-asp-based-multi-objective-scheduling","title":"Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes (Extended version)","date":"2023-07-27","arxiv_id":"2307.14799","repositories_listed":0,"syntology":null},{"url":null,"slug":"curriculum-learning-in-job-shop-scheduling","title":"Curriculum Learning in Job Shop Scheduling using Reinforcement Learning","date":"2023-05-17","arxiv_id":"2305.10192","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-stage-learning-for-the-flexible-job-shop","title":"Two-Stage Learning For the Flexible Job Shop Scheduling Problem","date":"2023-01-23","arxiv_id":"2301.09703","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-memetic-algorithm-with-reinforcement","title":"A Memetic Algorithm with Reinforcement Learning for Sociotechnical Production Scheduling","date":"2022-12-21","arxiv_id":"2212.10936","repositories_listed":0,"syntology":null},{"url":null,"slug":"monte-carlo-tree-search-for-leveraging","title":"Monte-Carlo Tree-Search for Leveraging Performance of Blackbox Job-Shop Scheduling Heuristics","date":"2022-12-14","arxiv_id":"2212.07543","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-constraint-programming-via","title":"Enhancing Constraint Programming via Supervised Learning for Job Shop Scheduling","date":"2022-11-26","arxiv_id":"2211.14492","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-approach-for-multi","title":"Reinforcement Learning Approach for Multi-Agent Flexible Scheduling Problems","date":"2022-10-07","arxiv_id":"2210.03674","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-quality-of-machine-permutations","title":"Learning the Quality of Machine Permutations in Job Shop Scheduling","date":"2022-07-07","arxiv_id":"2207.03244","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-heuristic-method-for-data-allocation-and","title":"A heuristic method for data allocation and task scheduling on heterogeneous multiprocessor systems under memory constraints","date":"2022-05-09","arxiv_id":"2206.05268","repositories_listed":0,"syntology":null},{"url":null,"slug":"vehicle-management-in-a-modular-production","title":"Vehicle management in a modular production context using Deep Q-Learning","date":"2022-05-06","arxiv_id":"2205.03294","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-approximations-for-job-shop-scheduling-a","title":"Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning Method","date":"2021-10-12","arxiv_id":"2110.06365","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-priority-aware-replanning-and-resequencing","title":"A Priority-Aware Replanning and Resequencing Framework for Coordination of Connected and Automated Vehicles","date":"2021-09-12","arxiv_id":"2109.05573","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-extended-job-shop-scheduling","title":"Solving the Extended Job Shop Scheduling Problem with AGVs -- Classical and Quantum Approaches","date":"2021-09-10","arxiv_id":"2109.04830","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-neighborhood-structure-for-job-shop","title":"A new neighborhood structure for job shop scheduling problems","date":"2021-09-07","arxiv_id":"2109.02843","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-and-interpretable-dispatching-rules","title":"Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning","date":"2021-09-07","arxiv_id":"2109.03323","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-benchmarks-for-the-job-shop","title":"Large-Scale Benchmarks for the Job Shop Scheduling Problem","date":"2021-01-25","arxiv_id":"2102.08778","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-a-multi-resource-partial-ordering","title":"Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP","date":"2021-01-25","arxiv_id":"2101.10162","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-global-local-neighborhood-search-algorithm","title":"A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem","date":"2020-10-23","arxiv_id":"2010.12702","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-on-job-shop-scheduling","title":"Graph neural networks-based Scheduler for Production planning problems using Reinforcement Learning","date":"2020-09-08","arxiv_id":"2009.03836","repositories_listed":0,"syntology":null},{"url":null,"slug":"modular-constraint-solver-cooperation-via","title":"Modular Constraint Solver Cooperation via Abstract Interpretation","date":"2020-08-04","arxiv_id":"2008.01415","repositories_listed":0,"syntology":null},{"url":null,"slug":"particle-swarm-optimization-with-velocity","title":"Particle Swarm Optimization with Velocity Restriction and Evolutionary Parameters Selection for Scheduling Problem","date":"2020-06-19","arxiv_id":"2006.10935","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-cyclic-job-shop-scheduling-problem-the","title":"The cyclic job-shop scheduling problem: The new subclass of the job-shop problem and applying the Simulated annealing to solve it","date":"2020-06-19","arxiv_id":"2006.10938","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tailored-nsga-iii-instantiation-for","title":"A Tailored NSGA-III Instantiation for Flexible Job Shop Scheduling","date":"2020-04-14","arxiv_id":"2004.06564","repositories_listed":0,"syntology":null},{"url":null,"slug":"actor-critic-deep-reinforcement-learning-for-1","title":"Actor-Critic Deep Reinforcement Learning for Solving Job Shop Scheduling Problems","date":"2020-04-14","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"frequency-fitness-assignment-making","title":"Frequency Fitness Assignment: Making Optimization Algorithms Invariant under Bijective Transformations of the Objective Function Value","date":"2020-01-06","arxiv_id":"2001.01416","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-computing-based-hybrid-solution","title":"Quantum Computing based Hybrid Solution Strategies for Large-scale Discrete-Continuous Optimization Problems","date":"2019-10-29","arxiv_id":"1910.13045","repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-neural-network-approach-for-cyclic","title":"Recurrent neural network approach for cyclic job shop scheduling problem","date":"2019-10-21","arxiv_id":"1910.09437","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-inspired-by-nature-a-survey","title":"Algorithms Inspired by Nature: A Survey","date":"2018-12-13","arxiv_id":"1903.01893","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-machine-collaborative-optimization-via","title":"Human-Machine Collaborative Optimization via Apprenticeship Scheduling","date":"2018-05-11","arxiv_id":"1805.04220","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluation-of-bioinspired-algorithms-for-the","title":"Evaluation of bioinspired algorithms for the solution of the job scheduling problem","date":"2017-11-21","arxiv_id":"1711.07821","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-self-tuning-firefly-algorithm-to-tune-the","title":"A self-tuning Firefly algorithm to tune the parameters of Ant Colony System (ACSFA)","date":"2016-10-26","arxiv_id":"1610.08222","repositories_listed":0,"syntology":null},{"url":null,"slug":"generation-of-near-optimal-solutions-using","title":"Generation of Near-Optimal Solutions Using ILP-Guided Sampling","date":"2016-08-03","arxiv_id":"1608.01093","repositories_listed":0,"syntology":null}],"syntology_records":10,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/task/job-shop-scheduling/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/job-shop-scheduling/papers/ran/1","json":"/task/job-shop-scheduling/papers/ran/1.json","rows":9}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"aebf37498630bf4ae5ada37b538e35b4cb8c171ac303c5b56d739adecc8a6f1a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}