{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D5A66E4VZZWOL6K2PQ4BHRYBJ3","short_pith_number":"pith:D5A66E4V","schema_version":"1.0","canonical_sha256":"1f41ef1395ce6ce5f95a7c3813c7014eea6db99773d84847e7ca0e68199ce3c0","source":{"kind":"arxiv","id":"1408.5832","version":1},"attestation_state":"computed","paper":{"title":"Reducing the Number of Changeover Constraints in a MIP Formulation of a Continuous-Time Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anton V. Eremeev, Josef Kallrath, Pavel A. Borisovsky","submitted_at":"2014-08-25T16:52:13Z","abstract_excerpt":"In this paper, we develop a new formulation of changeover constraints for mixed integer programming problem (MIP) that emerges in solving a short-term production scheduling problem. The new model requires fewer constraints than the original formulation and this often leads to shorter computation time of a MIP solver. Besides that, the new formulation is more flexible if the time windows for changeover tasks are given."},"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":"1408.5832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-25T16:52:13Z","cross_cats_sorted":[],"title_canon_sha256":"3113ae89395e99944a243ff7f8ebdd015c55cee6d1336b8a7343edd96d69d2ea","abstract_canon_sha256":"58bff0efa5b64be0e7d098648d40ab767b7c04a3f5502d411a6061d771f924e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:07.981902Z","signature_b64":"2b5chUMFquYpdPbu70CEtQsPy9/R1Wy9zFPbtY1mU92vWTD4n2ilZYWigPVFL+kDRhHDA/10AtZvJ+I+CKzTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f41ef1395ce6ce5f95a7c3813c7014eea6db99773d84847e7ca0e68199ce3c0","last_reissued_at":"2026-05-18T02:44:07.981293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:07.981293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing the Number of Changeover Constraints in a MIP Formulation of a Continuous-Time Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anton V. Eremeev, Josef Kallrath, Pavel A. Borisovsky","submitted_at":"2014-08-25T16:52:13Z","abstract_excerpt":"In this paper, we develop a new formulation of changeover constraints for mixed integer programming problem (MIP) that emerges in solving a short-term production scheduling problem. The new model requires fewer constraints than the original formulation and this often leads to shorter computation time of a MIP solver. Besides that, the new formulation is more flexible if the time windows for changeover tasks are given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5832","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":""},"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":"1408.5832","created_at":"2026-05-18T02:44:07.981403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5832v1","created_at":"2026-05-18T02:44:07.981403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5832","created_at":"2026-05-18T02:44:07.981403+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5A66E4VZZWO","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5A66E4VZZWOL6K2","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5A66E4V","created_at":"2026-05-18T12:28:25.294606+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/D5A66E4VZZWOL6K2PQ4BHRYBJ3","json":"https://pith.science/pith/D5A66E4VZZWOL6K2PQ4BHRYBJ3.json","graph_json":"https://pith.science/api/pith-number/D5A66E4VZZWOL6K2PQ4BHRYBJ3/graph.json","events_json":"https://pith.science/api/pith-number/D5A66E4VZZWOL6K2PQ4BHRYBJ3/events.json","paper":"https://pith.science/paper/D5A66E4V"},"agent_actions":{"view_html":"https://pith.science/pith/D5A66E4VZZWOL6K2PQ4BHRYBJ3","download_json":"https://pith.science/pith/D5A66E4VZZWOL6K2PQ4BHRYBJ3.json","view_paper":"https://pith.science/paper/D5A66E4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5832&json=true","fetch_graph":"https://pith.science/api/pith-number/D5A66E4VZZWOL6K2PQ4BHRYBJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/D5A66E4VZZWOL6K2PQ4BHRYBJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5A66E4VZZWOL6K2PQ4BHRYBJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5A66E4VZZWOL6K2PQ4BHRYBJ3/action/storage_attestation","attest_author":"https://pith.science/pith/D5A66E4VZZWOL6K2PQ4BHRYBJ3/action/author_attestation","sign_citation":"https://pith.science/pith/D5A66E4VZZWOL6K2PQ4BHRYBJ3/action/citation_signature","submit_replication":"https://pith.science/pith/D5A66E4VZZWOL6K2PQ4BHRYBJ3/action/replication_record"}},"created_at":"2026-05-18T02:44:07.981403+00:00","updated_at":"2026-05-18T02:44:07.981403+00:00"}