{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VR3BPYMYQ6M3BJVBTLGMHRQM33","short_pith_number":"pith:VR3BPYMY","schema_version":"1.0","canonical_sha256":"ac7617e1988799b0a6a19accc3c60cdefb0fa38a386c7b7c610b6918875bf0af","source":{"kind":"arxiv","id":"1903.09035","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Clarisse Dhaenens, Lucien Mousin, Marie-El\\'eonore Kessaci","submitted_at":"2019-03-21T14:48:00Z","abstract_excerpt":"The no-wait flowshop scheduling problem is a variant of the classical permutation flowshop problem, with the additional constraint that jobs have to be processed by the successive machines without waiting time. To efficiently address this NP-hard combinatorial optimization problem we conduct an analysis of the structure of good quality solutions. This analysis shows that the No-Wait specificity gives them a common structure: they share identical sub-sequences of jobs, we call super-jobs. After a discussion on the way to identify these super-jobs, we propose IG-SJ, an algorithm that exploits su"},"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":"1903.09035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-21T14:48:00Z","cross_cats_sorted":[],"title_canon_sha256":"822e332c39ec0cc071b9b4cf880bc8db354af3217ec4e88e80a74ac364d7fd5c","abstract_canon_sha256":"827a732245a4a149fd50ff3b08466263907d3744973cc958d427defc1633d012"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:43.301823Z","signature_b64":"LmanPq+dOIvV15geLYLzB2KxhEZaCoUtp3vTivaDyPyJoV0dntf8AmVXUgeu6FHlNqjDa3KIN8HcD20DmG1NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac7617e1988799b0a6a19accc3c60cdefb0fa38a386c7b7c610b6918875bf0af","last_reissued_at":"2026-05-17T23:50:43.301415Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:43.301415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Clarisse Dhaenens, Lucien Mousin, Marie-El\\'eonore Kessaci","submitted_at":"2019-03-21T14:48:00Z","abstract_excerpt":"The no-wait flowshop scheduling problem is a variant of the classical permutation flowshop problem, with the additional constraint that jobs have to be processed by the successive machines without waiting time. To efficiently address this NP-hard combinatorial optimization problem we conduct an analysis of the structure of good quality solutions. This analysis shows that the No-Wait specificity gives them a common structure: they share identical sub-sequences of jobs, we call super-jobs. After a discussion on the way to identify these super-jobs, we propose IG-SJ, an algorithm that exploits su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09035","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":"1903.09035","created_at":"2026-05-17T23:50:43.301493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09035v1","created_at":"2026-05-17T23:50:43.301493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09035","created_at":"2026-05-17T23:50:43.301493+00:00"},{"alias_kind":"pith_short_12","alias_value":"VR3BPYMYQ6M3","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VR3BPYMYQ6M3BJVB","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VR3BPYMY","created_at":"2026-05-18T12:33:30.264802+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/VR3BPYMYQ6M3BJVBTLGMHRQM33","json":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33.json","graph_json":"https://pith.science/api/pith-number/VR3BPYMYQ6M3BJVBTLGMHRQM33/graph.json","events_json":"https://pith.science/api/pith-number/VR3BPYMYQ6M3BJVBTLGMHRQM33/events.json","paper":"https://pith.science/paper/VR3BPYMY"},"agent_actions":{"view_html":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33","download_json":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33.json","view_paper":"https://pith.science/paper/VR3BPYMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09035&json=true","fetch_graph":"https://pith.science/api/pith-number/VR3BPYMYQ6M3BJVBTLGMHRQM33/graph.json","fetch_events":"https://pith.science/api/pith-number/VR3BPYMYQ6M3BJVBTLGMHRQM33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/action/storage_attestation","attest_author":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/action/author_attestation","sign_citation":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/action/citation_signature","submit_replication":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/action/replication_record"}},"created_at":"2026-05-17T23:50:43.301493+00:00","updated_at":"2026-05-17T23:50:43.301493+00:00"}