{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MRIFWOZBNYO3JHGWRTDU66VS3X","short_pith_number":"pith:MRIFWOZB","schema_version":"1.0","canonical_sha256":"64505b3b216e1db49cd68cc74f7ab2ddc5e7802fa38fed53481f675ba2e9bbdd","source":{"kind":"arxiv","id":"2402.15670","version":1},"attestation_state":"computed","paper":{"title":"A mathematical model for simultaneous personnel shift planning and unrelated parallel machine scheduling","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.AI","authors_text":"Homayoun Najjaran, Maziyar Khadivi, Mostafa Abbasi, Todd Charter","submitted_at":"2024-02-24T01:04:04Z","abstract_excerpt":"This paper addresses a production scheduling problem derived from an industrial use case, focusing on unrelated parallel machine scheduling with the personnel availability constraint. The proposed model optimizes the production plan over a multi-period scheduling horizon, accommodating variations in personnel shift hours within each time period. It assumes shared personnel among machines, with one personnel required per machine for setup and supervision during job processing. Available personnel are fewer than the machines, thus limiting the number of machines that can operate in parallel. The"},"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":"2402.15670","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-24T01:04:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"09e53cbc28a92f57f9a80e90282bf23b68c54cd4007f3433ad12944f50f65721","abstract_canon_sha256":"0c80112b70df3344e59b93ffefc75d2b6cef126b64fc1a5b2db13a9b70119023"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:48:56.296340Z","signature_b64":"t+QzBoVo05jGbKHCZAmJKcD2onCAbsVDBcomtdxAs1ZI4K2gmUQ5eL0F08X0gNhNR9yysOYrE7m9sqlJ/79ACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64505b3b216e1db49cd68cc74f7ab2ddc5e7802fa38fed53481f675ba2e9bbdd","last_reissued_at":"2026-07-05T07:48:56.295867Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:48:56.295867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A mathematical model for simultaneous personnel shift planning and unrelated parallel machine scheduling","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.AI","authors_text":"Homayoun Najjaran, Maziyar Khadivi, Mostafa Abbasi, Todd Charter","submitted_at":"2024-02-24T01:04:04Z","abstract_excerpt":"This paper addresses a production scheduling problem derived from an industrial use case, focusing on unrelated parallel machine scheduling with the personnel availability constraint. The proposed model optimizes the production plan over a multi-period scheduling horizon, accommodating variations in personnel shift hours within each time period. It assumes shared personnel among machines, with one personnel required per machine for setup and supervision during job processing. Available personnel are fewer than the machines, thus limiting the number of machines that can operate in parallel. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.15670","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/2402.15670/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":"2402.15670","created_at":"2026-07-05T07:48:56.295928+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.15670v1","created_at":"2026-07-05T07:48:56.295928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.15670","created_at":"2026-07-05T07:48:56.295928+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRIFWOZBNYO3","created_at":"2026-07-05T07:48:56.295928+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRIFWOZBNYO3JHGW","created_at":"2026-07-05T07:48:56.295928+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRIFWOZB","created_at":"2026-07-05T07:48:56.295928+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.10543","citing_title":"An Innovative Data-Driven and Adaptive Reinforcement Learning Approach for Context-Aware Prescriptive Process Monitoring","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MRIFWOZBNYO3JHGWRTDU66VS3X","json":"https://pith.science/pith/MRIFWOZBNYO3JHGWRTDU66VS3X.json","graph_json":"https://pith.science/api/pith-number/MRIFWOZBNYO3JHGWRTDU66VS3X/graph.json","events_json":"https://pith.science/api/pith-number/MRIFWOZBNYO3JHGWRTDU66VS3X/events.json","paper":"https://pith.science/paper/MRIFWOZB"},"agent_actions":{"view_html":"https://pith.science/pith/MRIFWOZBNYO3JHGWRTDU66VS3X","download_json":"https://pith.science/pith/MRIFWOZBNYO3JHGWRTDU66VS3X.json","view_paper":"https://pith.science/paper/MRIFWOZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.15670&json=true","fetch_graph":"https://pith.science/api/pith-number/MRIFWOZBNYO3JHGWRTDU66VS3X/graph.json","fetch_events":"https://pith.science/api/pith-number/MRIFWOZBNYO3JHGWRTDU66VS3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRIFWOZBNYO3JHGWRTDU66VS3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRIFWOZBNYO3JHGWRTDU66VS3X/action/storage_attestation","attest_author":"https://pith.science/pith/MRIFWOZBNYO3JHGWRTDU66VS3X/action/author_attestation","sign_citation":"https://pith.science/pith/MRIFWOZBNYO3JHGWRTDU66VS3X/action/citation_signature","submit_replication":"https://pith.science/pith/MRIFWOZBNYO3JHGWRTDU66VS3X/action/replication_record"}},"created_at":"2026-07-05T07:48:56.295928+00:00","updated_at":"2026-07-05T07:48:56.295928+00:00"}