{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LVYUG2OG3CBBTHUJOHUILBTPHG","short_pith_number":"pith:LVYUG2OG","schema_version":"1.0","canonical_sha256":"5d714369c6d882199e8971e885866f39aa82350f28798f32bba7f78953001a30","source":{"kind":"arxiv","id":"1711.04556","version":1},"attestation_state":"computed","paper":{"title":"Solving the Resource Constrained Project Scheduling Problem Using the Parallel Tabu Search Designed for the CUDA Platform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DC","authors_text":"Libor Bukata, Premysl Sucha, Zdenek Hanzalek","submitted_at":"2017-11-13T12:52:49Z","abstract_excerpt":"In the paper, a parallel Tabu Search algorithm for the Resource Constrained Project Scheduling Problem is proposed. To deal with this NP-hard combinatorial problem many optimizations have been performed. For example, a resource evaluation algorithm is selected by a heuristic and an effective Tabu List was designed. In addition to that, a capacity-indexed resource evaluation algorithm was proposed and the GPU (Graphics Processing Unit) version uses a homogeneous model to reduce the required communication bandwidth. According to the experiments, the GPU version outperforms the optimized parallel"},"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":"1711.04556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-13T12:52:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"deed609fb537760a868462db3a98f8d08a59f5243c8e9dbb2dad69189b5543b2","abstract_canon_sha256":"7f9967828b57514bc76df4a5cbce221a536c3fc6ee1d03fdfbc3148ad15fca44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:36.344142Z","signature_b64":"fEnp9I0len1x/LvZSckvRuPCPQeI0ktX7S0wCcYH38qEfdNPe5ws0CQ3H0LmFkk2YIXuKPbGvtaXS7btFz0BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d714369c6d882199e8971e885866f39aa82350f28798f32bba7f78953001a30","last_reissued_at":"2026-05-18T00:30:36.343419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:36.343419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the Resource Constrained Project Scheduling Problem Using the Parallel Tabu Search Designed for the CUDA Platform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DC","authors_text":"Libor Bukata, Premysl Sucha, Zdenek Hanzalek","submitted_at":"2017-11-13T12:52:49Z","abstract_excerpt":"In the paper, a parallel Tabu Search algorithm for the Resource Constrained Project Scheduling Problem is proposed. To deal with this NP-hard combinatorial problem many optimizations have been performed. For example, a resource evaluation algorithm is selected by a heuristic and an effective Tabu List was designed. In addition to that, a capacity-indexed resource evaluation algorithm was proposed and the GPU (Graphics Processing Unit) version uses a homogeneous model to reduce the required communication bandwidth. According to the experiments, the GPU version outperforms the optimized parallel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04556","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":"1711.04556","created_at":"2026-05-18T00:30:36.343542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04556v1","created_at":"2026-05-18T00:30:36.343542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04556","created_at":"2026-05-18T00:30:36.343542+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVYUG2OG3CBB","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVYUG2OG3CBBTHUJ","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVYUG2OG","created_at":"2026-05-18T12:31:28.150371+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/LVYUG2OG3CBBTHUJOHUILBTPHG","json":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG.json","graph_json":"https://pith.science/api/pith-number/LVYUG2OG3CBBTHUJOHUILBTPHG/graph.json","events_json":"https://pith.science/api/pith-number/LVYUG2OG3CBBTHUJOHUILBTPHG/events.json","paper":"https://pith.science/paper/LVYUG2OG"},"agent_actions":{"view_html":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG","download_json":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG.json","view_paper":"https://pith.science/paper/LVYUG2OG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04556&json=true","fetch_graph":"https://pith.science/api/pith-number/LVYUG2OG3CBBTHUJOHUILBTPHG/graph.json","fetch_events":"https://pith.science/api/pith-number/LVYUG2OG3CBBTHUJOHUILBTPHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/action/storage_attestation","attest_author":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/action/author_attestation","sign_citation":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/action/citation_signature","submit_replication":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/action/replication_record"}},"created_at":"2026-05-18T00:30:36.343542+00:00","updated_at":"2026-05-18T00:30:36.343542+00:00"}