{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PF2RQUUMQQ4O74J56MGB2NZS3I","short_pith_number":"pith:PF2RQUUM","schema_version":"1.0","canonical_sha256":"797518528c8438eff13df30c1d3732da1067c91c5e57481d9f6f53624e9c0e0d","source":{"kind":"arxiv","id":"1809.10428","version":1},"attestation_state":"computed","paper":{"title":"Scheduling on (Un-)Related Machines with Setup Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander M\\\"acker, Klaus Jansen, Marten Maack","submitted_at":"2018-09-27T09:41:39Z","abstract_excerpt":"We consider a natural generalization of scheduling $n$ jobs on $m$ parallel machines so as to minimize the makespan. In our extension the set of jobs is partitioned into several classes and a machine requires a setup whenever it switches from processing jobs of one class to jobs of a different class. During such a setup, a machine cannot process jobs and the duration of a setup may depend on the machine as well as the class of the job to be processed next.\n  For this problem, we study approximation algorithms for non-identical machines. We develop a polynomial-time approximation scheme for uni"},"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":"1809.10428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-27T09:41:39Z","cross_cats_sorted":[],"title_canon_sha256":"925aa5357103c09a24aeb0fb423f209cc18da4e9f0e70d65a7ccc7e4d0963ea4","abstract_canon_sha256":"6b4e4d053e977d4397ba1398baf36b3084d1d471e4d620e52e8162ae850bc130"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.375541Z","signature_b64":"EyzdhW3zJga85BoMXfyh2vLs04xOmP6mDrtwlYsdyzLnUVQvC+Vuj4w01sG7H5tEL1eF37jqetJi/f4CrYn4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"797518528c8438eff13df30c1d3732da1067c91c5e57481d9f6f53624e9c0e0d","last_reissued_at":"2026-05-18T00:04:38.375069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.375069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling on (Un-)Related Machines with Setup Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander M\\\"acker, Klaus Jansen, Marten Maack","submitted_at":"2018-09-27T09:41:39Z","abstract_excerpt":"We consider a natural generalization of scheduling $n$ jobs on $m$ parallel machines so as to minimize the makespan. In our extension the set of jobs is partitioned into several classes and a machine requires a setup whenever it switches from processing jobs of one class to jobs of a different class. During such a setup, a machine cannot process jobs and the duration of a setup may depend on the machine as well as the class of the job to be processed next.\n  For this problem, we study approximation algorithms for non-identical machines. We develop a polynomial-time approximation scheme for uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10428","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":"1809.10428","created_at":"2026-05-18T00:04:38.375142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10428v1","created_at":"2026-05-18T00:04:38.375142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10428","created_at":"2026-05-18T00:04:38.375142+00:00"},{"alias_kind":"pith_short_12","alias_value":"PF2RQUUMQQ4O","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PF2RQUUMQQ4O74J5","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PF2RQUUM","created_at":"2026-05-18T12:32:43.782077+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/PF2RQUUMQQ4O74J56MGB2NZS3I","json":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I.json","graph_json":"https://pith.science/api/pith-number/PF2RQUUMQQ4O74J56MGB2NZS3I/graph.json","events_json":"https://pith.science/api/pith-number/PF2RQUUMQQ4O74J56MGB2NZS3I/events.json","paper":"https://pith.science/paper/PF2RQUUM"},"agent_actions":{"view_html":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I","download_json":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I.json","view_paper":"https://pith.science/paper/PF2RQUUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10428&json=true","fetch_graph":"https://pith.science/api/pith-number/PF2RQUUMQQ4O74J56MGB2NZS3I/graph.json","fetch_events":"https://pith.science/api/pith-number/PF2RQUUMQQ4O74J56MGB2NZS3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/action/storage_attestation","attest_author":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/action/author_attestation","sign_citation":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/action/citation_signature","submit_replication":"https://pith.science/pith/PF2RQUUMQQ4O74J56MGB2NZS3I/action/replication_record"}},"created_at":"2026-05-18T00:04:38.375142+00:00","updated_at":"2026-05-18T00:04:38.375142+00:00"}