{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GAMVK5R52MYQNDJFDFS42E7LTX","short_pith_number":"pith:GAMVK5R5","schema_version":"1.0","canonical_sha256":"301955763dd331068d251965cd13eb9dddeeb52a89e64b3a16f9f728b4125a4f","source":{"kind":"arxiv","id":"1301.7134","version":2},"attestation_state":"computed","paper":{"title":"A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Peng Guo, Wenming Chen, Yi Wang","submitted_at":"2013-01-30T03:12:50Z","abstract_excerpt":"In this article, we study a single-machine scheduling problem of minimizing the total tardiness for a set of independent jobs. The processing time of a job is modeled as a step function of its starting time and a specific deteriorating date. A mixed integer programming model was applied to the problem and validated. Since the problem is known to be NP-hard, we proposed a heuristic named simple weighted search procedure (SWSP) and a general variable neighborhood search algorithm (GVNS).\n  A perturbation procedure with 3-opt is embedded within the GVNS process in order to explore broader spaces."},"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":"1301.7134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-30T03:12:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"27964d990cd422594b4785c3cb5223cc5b3481f037ec8bcd2989ae761c7a6407","abstract_canon_sha256":"2044aff831d9fe33ab2653386096cd06325829f36637b83d9439ae518474214b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:55.826035Z","signature_b64":"VQaWlVcirLc0+JxZ0NupuEBAl2hAIa0CmWAqTp5C+6Qgl41IxQ9xjrixSeK3yAoFiAAO7AUtEGaGrG+x/fIwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"301955763dd331068d251965cd13eb9dddeeb52a89e64b3a16f9f728b4125a4f","last_reissued_at":"2026-05-18T03:15:55.825179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:55.825179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Peng Guo, Wenming Chen, Yi Wang","submitted_at":"2013-01-30T03:12:50Z","abstract_excerpt":"In this article, we study a single-machine scheduling problem of minimizing the total tardiness for a set of independent jobs. The processing time of a job is modeled as a step function of its starting time and a specific deteriorating date. A mixed integer programming model was applied to the problem and validated. Since the problem is known to be NP-hard, we proposed a heuristic named simple weighted search procedure (SWSP) and a general variable neighborhood search algorithm (GVNS).\n  A perturbation procedure with 3-opt is embedded within the GVNS process in order to explore broader spaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7134","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":"1301.7134","created_at":"2026-05-18T03:15:55.825334+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7134v2","created_at":"2026-05-18T03:15:55.825334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7134","created_at":"2026-05-18T03:15:55.825334+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAMVK5R52MYQ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAMVK5R52MYQNDJF","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAMVK5R5","created_at":"2026-05-18T12:27:45.050594+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/GAMVK5R52MYQNDJFDFS42E7LTX","json":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX.json","graph_json":"https://pith.science/api/pith-number/GAMVK5R52MYQNDJFDFS42E7LTX/graph.json","events_json":"https://pith.science/api/pith-number/GAMVK5R52MYQNDJFDFS42E7LTX/events.json","paper":"https://pith.science/paper/GAMVK5R5"},"agent_actions":{"view_html":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX","download_json":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX.json","view_paper":"https://pith.science/paper/GAMVK5R5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7134&json=true","fetch_graph":"https://pith.science/api/pith-number/GAMVK5R52MYQNDJFDFS42E7LTX/graph.json","fetch_events":"https://pith.science/api/pith-number/GAMVK5R52MYQNDJFDFS42E7LTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX/action/storage_attestation","attest_author":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX/action/author_attestation","sign_citation":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX/action/citation_signature","submit_replication":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX/action/replication_record"}},"created_at":"2026-05-18T03:15:55.825334+00:00","updated_at":"2026-05-18T03:15:55.825334+00:00"}