{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IUQTEFX2H3S7GAIEI57CIFHVOL","short_pith_number":"pith:IUQTEFX2","schema_version":"1.0","canonical_sha256":"45213216fa3ee5f30104477e2414f572f65d128d77e1c910281161a9e9f0606d","source":{"kind":"arxiv","id":"1111.0773","version":2},"attestation_state":"computed","paper":{"title":"On the Value of Job Migration in Online Makespan Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matthias Hellwig, Susanne Albers","submitted_at":"2011-11-03T10:27:20Z","abstract_excerpt":"Makespan minimization on identical parallel machines is a classical scheduling problem. We consider the online scenario where a sequence of $n$ jobs has to be scheduled non-preemptively on $m$ machines so as to minimize the maximum completion time of any job. The best competitive ratio that can be achieved by deterministic online algorithms is in the range $[1.88,1.9201]$. Currently no randomized online algorithm with a smaller competitiveness is known, for general $m$.\n  In this paper we explore the power of job migration, i.e.\\ an online scheduler is allowed to perform a limited number of jo"},"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":"1111.0773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-03T10:27:20Z","cross_cats_sorted":[],"title_canon_sha256":"7b6dd0e374f34231e913870dfe619d837d98a490995c9ee79540c8dcfdd1ce5a","abstract_canon_sha256":"3a051770e55b2749805cd03958d76aefbb7227a05cdf9e4fa1838b2272e7f9d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:37.759525Z","signature_b64":"71J6YdvHAP3x2xE84MxztqCrmUKoPupBUsIl7o1yLopR86XH7VNa5LZdPymyzv2/2nyVEdmIoeQG2OHdthp2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45213216fa3ee5f30104477e2414f572f65d128d77e1c910281161a9e9f0606d","last_reissued_at":"2026-05-18T04:00:37.758673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:37.758673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Value of Job Migration in Online Makespan Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matthias Hellwig, Susanne Albers","submitted_at":"2011-11-03T10:27:20Z","abstract_excerpt":"Makespan minimization on identical parallel machines is a classical scheduling problem. We consider the online scenario where a sequence of $n$ jobs has to be scheduled non-preemptively on $m$ machines so as to minimize the maximum completion time of any job. The best competitive ratio that can be achieved by deterministic online algorithms is in the range $[1.88,1.9201]$. Currently no randomized online algorithm with a smaller competitiveness is known, for general $m$.\n  In this paper we explore the power of job migration, i.e.\\ an online scheduler is allowed to perform a limited number of jo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0773","kind":"arxiv","version":2},"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":"1111.0773","created_at":"2026-05-18T04:00:37.758821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0773v2","created_at":"2026-05-18T04:00:37.758821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0773","created_at":"2026-05-18T04:00:37.758821+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUQTEFX2H3S7","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUQTEFX2H3S7GAIE","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUQTEFX2","created_at":"2026-05-18T12:26:32.869790+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/IUQTEFX2H3S7GAIEI57CIFHVOL","json":"https://pith.science/pith/IUQTEFX2H3S7GAIEI57CIFHVOL.json","graph_json":"https://pith.science/api/pith-number/IUQTEFX2H3S7GAIEI57CIFHVOL/graph.json","events_json":"https://pith.science/api/pith-number/IUQTEFX2H3S7GAIEI57CIFHVOL/events.json","paper":"https://pith.science/paper/IUQTEFX2"},"agent_actions":{"view_html":"https://pith.science/pith/IUQTEFX2H3S7GAIEI57CIFHVOL","download_json":"https://pith.science/pith/IUQTEFX2H3S7GAIEI57CIFHVOL.json","view_paper":"https://pith.science/paper/IUQTEFX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0773&json=true","fetch_graph":"https://pith.science/api/pith-number/IUQTEFX2H3S7GAIEI57CIFHVOL/graph.json","fetch_events":"https://pith.science/api/pith-number/IUQTEFX2H3S7GAIEI57CIFHVOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUQTEFX2H3S7GAIEI57CIFHVOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUQTEFX2H3S7GAIEI57CIFHVOL/action/storage_attestation","attest_author":"https://pith.science/pith/IUQTEFX2H3S7GAIEI57CIFHVOL/action/author_attestation","sign_citation":"https://pith.science/pith/IUQTEFX2H3S7GAIEI57CIFHVOL/action/citation_signature","submit_replication":"https://pith.science/pith/IUQTEFX2H3S7GAIEI57CIFHVOL/action/replication_record"}},"created_at":"2026-05-18T04:00:37.758821+00:00","updated_at":"2026-05-18T04:00:37.758821+00:00"}