SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2010.12367 · 2020

Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning

arXiv · PDF · Open in the Atlas

Code that ran

1 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 0 failures of our instrument; 2 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2010.12367.json · badge: /api/ran/2010.12367.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
tmdt-buw/schlably community (classifier label)
classifier basis not recorded on the link
1 ran · 2 no recorded run
FunctionStatusWhere it lives
timing_decorator_factory Ran
ran on a synthesized input
tmdt-buw/schlably/src/code_tests/timer.py
code served (permissive licence) · get_code("e6a2b897802472fb")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned function. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import time

func_runtimes = {}

def timing_decorator_factory(print_runtime: bool=False, print_runtime_average: bool=False) -> None:
    """
    Times code execution
    :param print_runtime: If true, prints the runtime
    :param print_runtime_average: If true, prints runtime_average
    :return: None
    """

    def timing_decorator(func):

        def wrapper(*args, **kwargs):
            start = time.time()
            original_return_val = func(*args, **kwargs)
            end = time.time()
            elapsed_time = end - start
            func_runtimes.setdefault(func.__name__, []).append(elapsed_time)
            if print_runtime:
                print('time elapsed in ', func.__name__, ': ', elapsed_time, sep='')
            if print_runtime_average:
                runtimes = func_runtimes[func.__name__]
                total_runtime = sum(runtimes)
                average = total_runtime / len(runtimes)
                print('average run time in ', func.__name__, ': ', average, sep='')
            return original_return_val
        return wrapper
    return timing_decorator


ARGS = {
    'print_runtime': True,
    'print_runtime_average': True,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
none outside the standard library — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type function — a function output has no array shape of its own; none is stated — the instrument coerces any output to an array; for a function output the recorded ndim 0 and dtype family float describe that coercion, not the output, and are not stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
complete_config Not yet run
unverified (harvested, no recorded run)
tmdt-buw/schlably/src/agents/train_test_utility_functions.py
code served (permissive licence) · get_code("6858af4a494f0e3c")
How it ran

no invocation recorded.

load Not yet run
unverified (harvested, no recorded run)
tmdt-buw/schlably/src/agents/rllib_interface.py
code served (permissive licence) · get_code("7dde7f433f1684bc")
How it ran

no invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Priority dispatching rule (PDR) is widely used for solving real-world Job-shop scheduling problem (JSSP). However, the design of effective PDRs is a tedious task, requiring a myriad of specialized knowledge and often delivering limited performance. In this paper, we propose to automatically learn PDRs via an end-to-end deep reinforcement learning agent. We exploit the disjunctive graph representation of JSSP, and propose a Graph Neural Network based scheme to embed the states encountered during solving. The resulting policy network is size-agnostic, effectively enabling generalization on large-scale instances. Experiments show that the agent can learn high-quality PDRs from scratch with elementary raw features, and demonstrates strong performance against the best existing PDRs. The learned policies also perform well on much larger instances that are unseen in training.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2010.12367")
get_code_for_paper("2010.12367")
have("2010.12367")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2010.12367.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2010.12367.svg)](https://syntology.ai/paper/2010.12367)

Connect an agent — have() is free.