{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZM7OHIWBXYY3OMVOQXFZ5FKWQZ","short_pith_number":"pith:ZM7OHIWB","schema_version":"1.0","canonical_sha256":"cb3ee3a2c1be31b732ae85cb9e9556864695934b37baf14be5dc93d03317593f","source":{"kind":"arxiv","id":"2501.17991","version":1},"attestation_state":"computed","paper":{"title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Damien Ernst, Laurie Boveroux, Quentin Louveaux","submitted_at":"2025-01-29T20:55:53Z","abstract_excerpt":"The Job Shop Scheduling Problem (JSSP) is a well-known optimization problem in manufacturing, where the goal is to determine the optimal sequence of jobs across different machines to minimize a given objective. In this work, we focus on minimising the weighted sum of job completion times. We explore the potential of Monte Carlo Tree Search (MCTS), a heuristic-based reinforcement learning technique, to solve large-scale JSSPs, especially those with recirculation. We propose several Markov Decision Process (MDP) formulations to model the JSSP for the MCTS algorithm. In addition, we introduce a n"},"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":"2501.17991","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-01-29T20:55:53Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c9ac893fa9d58ac15ee3f707c947acacc21faa481a77ae5b5ba6777d762117e0","abstract_canon_sha256":"139f08eac28227e1406585afebc1ee349792df585e91f0f47e84b514cf4b00ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:05.305522Z","signature_b64":"4l1S92G1wzo9UQS0KOb6qewwjPRb6za7j96rIPJR+h1QWX80ZqQUuZ2HzVfqNkZ9POiSGat8kqnzgKe3RD9LAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb3ee3a2c1be31b732ae85cb9e9556864695934b37baf14be5dc93d03317593f","last_reissued_at":"2026-07-05T10:07:05.305026Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:05.305026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Damien Ernst, Laurie Boveroux, Quentin Louveaux","submitted_at":"2025-01-29T20:55:53Z","abstract_excerpt":"The Job Shop Scheduling Problem (JSSP) is a well-known optimization problem in manufacturing, where the goal is to determine the optimal sequence of jobs across different machines to minimize a given objective. In this work, we focus on minimising the weighted sum of job completion times. We explore the potential of Monte Carlo Tree Search (MCTS), a heuristic-based reinforcement learning technique, to solve large-scale JSSPs, especially those with recirculation. We propose several Markov Decision Process (MDP) formulations to model the JSSP for the MCTS algorithm. In addition, we introduce a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17991","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/2501.17991/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":"2501.17991","created_at":"2026-07-05T10:07:05.305086+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.17991v1","created_at":"2026-07-05T10:07:05.305086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17991","created_at":"2026-07-05T10:07:05.305086+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZM7OHIWBXYY3","created_at":"2026-07-05T10:07:05.305086+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZM7OHIWBXYY3OMVO","created_at":"2026-07-05T10:07:05.305086+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZM7OHIWB","created_at":"2026-07-05T10:07:05.305086+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/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ","json":"https://pith.science/pith/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ.json","graph_json":"https://pith.science/api/pith-number/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ/graph.json","events_json":"https://pith.science/api/pith-number/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ/events.json","paper":"https://pith.science/paper/ZM7OHIWB"},"agent_actions":{"view_html":"https://pith.science/pith/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ","download_json":"https://pith.science/pith/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ.json","view_paper":"https://pith.science/paper/ZM7OHIWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.17991&json=true","fetch_graph":"https://pith.science/api/pith-number/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZM7OHIWBXYY3OMVOQXFZ5FKWQZ/action/replication_record"}},"created_at":"2026-07-05T10:07:05.305086+00:00","updated_at":"2026-07-05T10:07:05.305086+00:00"}