{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VH5ZPOXLNWDXJEXVWLYCQJEPKD","short_pith_number":"pith:VH5ZPOXL","schema_version":"1.0","canonical_sha256":"a9fb97baeb6d877492f5b2f028248f50ce0b30d093c496af547674ce8aa5e509","source":{"kind":"arxiv","id":"1801.05489","version":1},"attestation_state":"computed","paper":{"title":"Longest Processing Time rule for identical parallel machines revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Federico Della Croce, Rosario Scatamacchia","submitted_at":"2018-01-16T21:39:50Z","abstract_excerpt":"We consider the Pm || Cmax scheduling problem where the goal is to schedule n jobs on m identical parallel machines to minimize makespan. We revisit the famous Longest Processing Time (LPT) rule proposed by Graham in 1969. LPT requires to sort jobs in non-ascending order of processing times and then to assign one job at a time to the machine whose load is smallest so far. We provide new insights on LPT and discuss the approximation ratio of a modification of LPT that improves Graham's bound from 4/3 - 1/(3m) to 4/3 - 1/(3(m-1)) for m >= 3 and from 7/6 to 9/8 for m = 2. We use Linear Programmin"},"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":"1801.05489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-16T21:39:50Z","cross_cats_sorted":[],"title_canon_sha256":"9b1da41a61f357f69fcebb8a2f5cd89cef6ad0bfee344bd4c7c8647e42b52774","abstract_canon_sha256":"97ab90aeb741452d6cfc6fc644e11a1824d25175eacfe5a2b2805e5f8c9d3098"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:41.111623Z","signature_b64":"9z660gLEbc/ZGT/LrnYSfMl2FWu5BTpYY0zoL8KO50BlhKAf5evEUK4l2aOXSGyl8tQJoBIy3za81e7J/cL0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9fb97baeb6d877492f5b2f028248f50ce0b30d093c496af547674ce8aa5e509","last_reissued_at":"2026-05-18T00:25:41.111077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:41.111077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest Processing Time rule for identical parallel machines revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Federico Della Croce, Rosario Scatamacchia","submitted_at":"2018-01-16T21:39:50Z","abstract_excerpt":"We consider the Pm || Cmax scheduling problem where the goal is to schedule n jobs on m identical parallel machines to minimize makespan. We revisit the famous Longest Processing Time (LPT) rule proposed by Graham in 1969. LPT requires to sort jobs in non-ascending order of processing times and then to assign one job at a time to the machine whose load is smallest so far. We provide new insights on LPT and discuss the approximation ratio of a modification of LPT that improves Graham's bound from 4/3 - 1/(3m) to 4/3 - 1/(3(m-1)) for m >= 3 and from 7/6 to 9/8 for m = 2. We use Linear Programmin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05489","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":"1801.05489","created_at":"2026-05-18T00:25:41.111164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05489v1","created_at":"2026-05-18T00:25:41.111164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05489","created_at":"2026-05-18T00:25:41.111164+00:00"},{"alias_kind":"pith_short_12","alias_value":"VH5ZPOXLNWDX","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VH5ZPOXLNWDXJEXV","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VH5ZPOXL","created_at":"2026-05-18T12:32:59.047623+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/VH5ZPOXLNWDXJEXVWLYCQJEPKD","json":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD.json","graph_json":"https://pith.science/api/pith-number/VH5ZPOXLNWDXJEXVWLYCQJEPKD/graph.json","events_json":"https://pith.science/api/pith-number/VH5ZPOXLNWDXJEXVWLYCQJEPKD/events.json","paper":"https://pith.science/paper/VH5ZPOXL"},"agent_actions":{"view_html":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD","download_json":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD.json","view_paper":"https://pith.science/paper/VH5ZPOXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05489&json=true","fetch_graph":"https://pith.science/api/pith-number/VH5ZPOXLNWDXJEXVWLYCQJEPKD/graph.json","fetch_events":"https://pith.science/api/pith-number/VH5ZPOXLNWDXJEXVWLYCQJEPKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/action/storage_attestation","attest_author":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/action/author_attestation","sign_citation":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/action/citation_signature","submit_replication":"https://pith.science/pith/VH5ZPOXLNWDXJEXVWLYCQJEPKD/action/replication_record"}},"created_at":"2026-05-18T00:25:41.111164+00:00","updated_at":"2026-05-18T00:25:41.111164+00:00"}