{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CJFGYK4XJCWTIS7BOMJOKOIACH","short_pith_number":"pith:CJFGYK4X","schema_version":"1.0","canonical_sha256":"124a6c2b9748ad344be17312e5390011e663ab0f46cd64f654c65b09030061f5","source":{"kind":"arxiv","id":"1501.05882","version":3},"attestation_state":"computed","paper":{"title":"Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anand Subramanian, Katyanne Farias","submitted_at":"2015-01-23T17:20:50Z","abstract_excerpt":"This paper concerns the single machine total weighted tardiness scheduling with sequence-dependent setup times, usually referred as $1|s_{ij}|\\sum w_jT_j$. In this $\\mathcal{NP}$-hard problem, each job has an associated processing time, due date and a weight. For each pair of jobs $i$ and $j$, there may be a setup time before starting to process $j$ in case this job is scheduled immediately after $i$. The objective is to determine a schedule that minimizes the total weighted tardiness, where the tardiness of a job is equal to its completion time minus its due date, in case the job is completel"},"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":"1501.05882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-01-23T17:20:50Z","cross_cats_sorted":[],"title_canon_sha256":"b3dbbca98f7d53f93b0b53a0a66cee935d76a5dd19ae6af7bbf9bb92d714e599","abstract_canon_sha256":"03ca653878e59eba80937b67dc75bb2f676f32e281bc4200aef7bda09946ee3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:39.531621Z","signature_b64":"Mk0fQT/Ho/m58FdRl2xdsal8b0L3V4NAsD9wVBh2TNN1O/5oEKnkmbwsoVWkd+UEFDDrjwJGq1mQu2nmWdOPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"124a6c2b9748ad344be17312e5390011e663ab0f46cd64f654c65b09030061f5","last_reissued_at":"2026-05-18T01:25:39.531012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:39.531012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anand Subramanian, Katyanne Farias","submitted_at":"2015-01-23T17:20:50Z","abstract_excerpt":"This paper concerns the single machine total weighted tardiness scheduling with sequence-dependent setup times, usually referred as $1|s_{ij}|\\sum w_jT_j$. In this $\\mathcal{NP}$-hard problem, each job has an associated processing time, due date and a weight. For each pair of jobs $i$ and $j$, there may be a setup time before starting to process $j$ in case this job is scheduled immediately after $i$. The objective is to determine a schedule that minimizes the total weighted tardiness, where the tardiness of a job is equal to its completion time minus its due date, in case the job is completel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05882","kind":"arxiv","version":3},"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":"1501.05882","created_at":"2026-05-18T01:25:39.531108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05882v3","created_at":"2026-05-18T01:25:39.531108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05882","created_at":"2026-05-18T01:25:39.531108+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJFGYK4XJCWT","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJFGYK4XJCWTIS7B","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJFGYK4X","created_at":"2026-05-18T12:29:14.074870+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/CJFGYK4XJCWTIS7BOMJOKOIACH","json":"https://pith.science/pith/CJFGYK4XJCWTIS7BOMJOKOIACH.json","graph_json":"https://pith.science/api/pith-number/CJFGYK4XJCWTIS7BOMJOKOIACH/graph.json","events_json":"https://pith.science/api/pith-number/CJFGYK4XJCWTIS7BOMJOKOIACH/events.json","paper":"https://pith.science/paper/CJFGYK4X"},"agent_actions":{"view_html":"https://pith.science/pith/CJFGYK4XJCWTIS7BOMJOKOIACH","download_json":"https://pith.science/pith/CJFGYK4XJCWTIS7BOMJOKOIACH.json","view_paper":"https://pith.science/paper/CJFGYK4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05882&json=true","fetch_graph":"https://pith.science/api/pith-number/CJFGYK4XJCWTIS7BOMJOKOIACH/graph.json","fetch_events":"https://pith.science/api/pith-number/CJFGYK4XJCWTIS7BOMJOKOIACH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJFGYK4XJCWTIS7BOMJOKOIACH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJFGYK4XJCWTIS7BOMJOKOIACH/action/storage_attestation","attest_author":"https://pith.science/pith/CJFGYK4XJCWTIS7BOMJOKOIACH/action/author_attestation","sign_citation":"https://pith.science/pith/CJFGYK4XJCWTIS7BOMJOKOIACH/action/citation_signature","submit_replication":"https://pith.science/pith/CJFGYK4XJCWTIS7BOMJOKOIACH/action/replication_record"}},"created_at":"2026-05-18T01:25:39.531108+00:00","updated_at":"2026-05-18T01:25:39.531108+00:00"}