{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W5JJHQI4NPSTFD2Q3JYSFQVDBT","short_pith_number":"pith:W5JJHQI4","schema_version":"1.0","canonical_sha256":"b75293c11c6be5328f50da7122c2a30cf111e5d28d7c9b10ba9a1623bce72f75","source":{"kind":"arxiv","id":"1811.12657","version":1},"attestation_state":"computed","paper":{"title":"Optimal Algorithms for Scheduling under Time-of-Use Tariffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jos\\'e Verschae, Leen Stougie, Lin Chen, Nicole Megow, Roman Rischke","submitted_at":"2018-11-30T07:57:40Z","abstract_excerpt":"We consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the sum of (weighted) completion times. It is not difficult to derive a polynomial-time algorithm for preemptive scheduling to minimize the makespan on unrelated machines. The problem of minimizing the total (weighted) completion time is considerably harder, even on a single machine. We present a polynomial-time algori"},"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":"1811.12657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-30T07:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"3bd0dbf46088ab768a8833ab66ced35a7956fb6097482f1141abd8acc87b46df","abstract_canon_sha256":"90413da3f51f33fb81050cab947c7c79f74ba54c56ee9e357619551b34938e8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:28.923209Z","signature_b64":"RLxbsxKRD6wRYGbaM16mLpKnzf0wck4MeA//wzQC4ID0P7oZAD8hFINMh6iA4qxrhudC35w5iR2gOJsHBUbFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b75293c11c6be5328f50da7122c2a30cf111e5d28d7c9b10ba9a1623bce72f75","last_reissued_at":"2026-05-17T23:59:28.922707Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:28.922707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Algorithms for Scheduling under Time-of-Use Tariffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jos\\'e Verschae, Leen Stougie, Lin Chen, Nicole Megow, Roman Rischke","submitted_at":"2018-11-30T07:57:40Z","abstract_excerpt":"We consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the sum of (weighted) completion times. It is not difficult to derive a polynomial-time algorithm for preemptive scheduling to minimize the makespan on unrelated machines. The problem of minimizing the total (weighted) completion time is considerably harder, even on a single machine. We present a polynomial-time algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12657","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":"1811.12657","created_at":"2026-05-17T23:59:28.922782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12657v1","created_at":"2026-05-17T23:59:28.922782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12657","created_at":"2026-05-17T23:59:28.922782+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5JJHQI4NPST","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5JJHQI4NPSTFD2Q","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5JJHQI4","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/W5JJHQI4NPSTFD2Q3JYSFQVDBT","json":"https://pith.science/pith/W5JJHQI4NPSTFD2Q3JYSFQVDBT.json","graph_json":"https://pith.science/api/pith-number/W5JJHQI4NPSTFD2Q3JYSFQVDBT/graph.json","events_json":"https://pith.science/api/pith-number/W5JJHQI4NPSTFD2Q3JYSFQVDBT/events.json","paper":"https://pith.science/paper/W5JJHQI4"},"agent_actions":{"view_html":"https://pith.science/pith/W5JJHQI4NPSTFD2Q3JYSFQVDBT","download_json":"https://pith.science/pith/W5JJHQI4NPSTFD2Q3JYSFQVDBT.json","view_paper":"https://pith.science/paper/W5JJHQI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12657&json=true","fetch_graph":"https://pith.science/api/pith-number/W5JJHQI4NPSTFD2Q3JYSFQVDBT/graph.json","fetch_events":"https://pith.science/api/pith-number/W5JJHQI4NPSTFD2Q3JYSFQVDBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5JJHQI4NPSTFD2Q3JYSFQVDBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5JJHQI4NPSTFD2Q3JYSFQVDBT/action/storage_attestation","attest_author":"https://pith.science/pith/W5JJHQI4NPSTFD2Q3JYSFQVDBT/action/author_attestation","sign_citation":"https://pith.science/pith/W5JJHQI4NPSTFD2Q3JYSFQVDBT/action/citation_signature","submit_replication":"https://pith.science/pith/W5JJHQI4NPSTFD2Q3JYSFQVDBT/action/replication_record"}},"created_at":"2026-05-17T23:59:28.922782+00:00","updated_at":"2026-05-17T23:59:28.922782+00:00"}