{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:F6FAJ647E33KCVZ5GGRNOSP5PU","short_pith_number":"pith:F6FAJ647","schema_version":"1.0","canonical_sha256":"2f8a04fb9f26f6a1573d31a2d749fd7d1318c96fd2c09267aae7c6da518c2402","source":{"kind":"arxiv","id":"2605.22773","version":1},"attestation_state":"computed","paper":{"title":"Deep Reinforcement Learning for Flexible Job Shop Scheduling with Random Job Arrivals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Alisa Rupenyan, Efe Balta, John Lygeros, Muhammad Zakwan, Yu Tang","submitted_at":"2026-05-21T17:33:09Z","abstract_excerpt":"The Flexible Job Shop Scheduling Problem (FJSP) is the optimal allocation of a set of jobs to machines. Two primary challenges persist in FJSP: the unpredictable arrival of future jobs and the combinatorial complexity of the problem, rendering it intractable for conventional mixed-integer linear programming solvers. This paper proposes an event-based \\gls{DRL} approach to solve FJSP with random job arrivals. Specifically, we employ the Proximal Policy Optimization algorithm and use lightweight Multi-Layer Perceptrons to train the \\gls{DRL} agent for minimizing the total completion time of all "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.22773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-21T17:33:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7a9e3a86e7d3b85aefa212d82f7379a9d6457cde57e6a7682141bc55f10a043c","abstract_canon_sha256":"fa7b7483e2b283d14ecb61a22c63e3b1c8a4da9764e0220e0039571654dd33ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T02:04:54.307512Z","signature_b64":"UaPLU2xb7BhDHQCPSwLPslO4zelhCdojAlQfGzuSzPjk3BOnGqBujhhQw2W6cspa6qCHhK2Me4B4EsatT6LcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f8a04fb9f26f6a1573d31a2d749fd7d1318c96fd2c09267aae7c6da518c2402","last_reissued_at":"2026-05-22T02:04:54.307040Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T02:04:54.307040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Reinforcement Learning for Flexible Job Shop Scheduling with Random Job Arrivals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Alisa Rupenyan, Efe Balta, John Lygeros, Muhammad Zakwan, Yu Tang","submitted_at":"2026-05-21T17:33:09Z","abstract_excerpt":"The Flexible Job Shop Scheduling Problem (FJSP) is the optimal allocation of a set of jobs to machines. Two primary challenges persist in FJSP: the unpredictable arrival of future jobs and the combinatorial complexity of the problem, rendering it intractable for conventional mixed-integer linear programming solvers. This paper proposes an event-based \\gls{DRL} approach to solve FJSP with random job arrivals. Specifically, we employ the Proximal Policy Optimization algorithm and use lightweight Multi-Layer Perceptrons to train the \\gls{DRL} agent for minimizing the total completion time of all "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22773","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.22773/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.22773","created_at":"2026-05-22T02:04:54.307103+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22773v1","created_at":"2026-05-22T02:04:54.307103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22773","created_at":"2026-05-22T02:04:54.307103+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6FAJ647E33K","created_at":"2026-05-22T02:04:54.307103+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6FAJ647E33KCVZ5","created_at":"2026-05-22T02:04:54.307103+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6FAJ647","created_at":"2026-05-22T02:04:54.307103+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F6FAJ647E33KCVZ5GGRNOSP5PU","json":"https://pith.science/pith/F6FAJ647E33KCVZ5GGRNOSP5PU.json","graph_json":"https://pith.science/api/pith-number/F6FAJ647E33KCVZ5GGRNOSP5PU/graph.json","events_json":"https://pith.science/api/pith-number/F6FAJ647E33KCVZ5GGRNOSP5PU/events.json","paper":"https://pith.science/paper/F6FAJ647"},"agent_actions":{"view_html":"https://pith.science/pith/F6FAJ647E33KCVZ5GGRNOSP5PU","download_json":"https://pith.science/pith/F6FAJ647E33KCVZ5GGRNOSP5PU.json","view_paper":"https://pith.science/paper/F6FAJ647","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22773&json=true","fetch_graph":"https://pith.science/api/pith-number/F6FAJ647E33KCVZ5GGRNOSP5PU/graph.json","fetch_events":"https://pith.science/api/pith-number/F6FAJ647E33KCVZ5GGRNOSP5PU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6FAJ647E33KCVZ5GGRNOSP5PU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6FAJ647E33KCVZ5GGRNOSP5PU/action/storage_attestation","attest_author":"https://pith.science/pith/F6FAJ647E33KCVZ5GGRNOSP5PU/action/author_attestation","sign_citation":"https://pith.science/pith/F6FAJ647E33KCVZ5GGRNOSP5PU/action/citation_signature","submit_replication":"https://pith.science/pith/F6FAJ647E33KCVZ5GGRNOSP5PU/action/replication_record"}},"created_at":"2026-05-22T02:04:54.307103+00:00","updated_at":"2026-05-22T02:04:54.307103+00:00"}