{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:47QDOFHEYAV7Q7LVP7V222FMQS","short_pith_number":"pith:47QDOFHE","schema_version":"1.0","canonical_sha256":"e7e03714e4c02bf87d757febad68ac84891a61931e76dfd4d5b9c8294be8a2a2","source":{"kind":"arxiv","id":"1401.3654","version":1},"attestation_state":"computed","paper":{"title":"A MILP model for an extended version of the Flexible Job Shop Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Cristina G. Fernandes, D\\'ebora P. Ronconi, Ernesto G. Birgin, Everton L. de Melo, Marcio T. I. Oshiro, Paulo Feofiloff","submitted_at":"2014-01-15T16:23:12Z","abstract_excerpt":"A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order. The goal is the minimization of the makespan. Theoretical and practical advantages of the proposed model are discussed. Numerical experiments show the performance of a commercial exact solver when applied to the proposed model. The new model is also compared with a simple extension of the model described by \\\"Ozg\\\"uven, \\\"Ozbakir, and Yavuz (Mathematical model"},"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":"1401.3654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T16:23:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dc9631b5d649b69bee70d7a0c76b827b87b2abeedb33765ae0e67a10f0638acc","abstract_canon_sha256":"b8f90f739f0a1b959af8e93fc5576f3f528c0293c8c67bafb706792c614701d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.060243Z","signature_b64":"F489MPeA3USHQ3MpsTuCnBJX7ZZPd4c3fjGl+WRyR5NmiE3yGVp3M2zD+woxQdL6I69TsrcfIyqkLAhXo9arDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7e03714e4c02bf87d757febad68ac84891a61931e76dfd4d5b9c8294be8a2a2","last_reissued_at":"2026-05-18T03:02:08.059485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.059485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A MILP model for an extended version of the Flexible Job Shop Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Cristina G. Fernandes, D\\'ebora P. Ronconi, Ernesto G. Birgin, Everton L. de Melo, Marcio T. I. Oshiro, Paulo Feofiloff","submitted_at":"2014-01-15T16:23:12Z","abstract_excerpt":"A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order. The goal is the minimization of the makespan. Theoretical and practical advantages of the proposed model are discussed. Numerical experiments show the performance of a commercial exact solver when applied to the proposed model. The new model is also compared with a simple extension of the model described by \\\"Ozg\\\"uven, \\\"Ozbakir, and Yavuz (Mathematical model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3654","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":"1401.3654","created_at":"2026-05-18T03:02:08.059625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3654v1","created_at":"2026-05-18T03:02:08.059625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3654","created_at":"2026-05-18T03:02:08.059625+00:00"},{"alias_kind":"pith_short_12","alias_value":"47QDOFHEYAV7","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"47QDOFHEYAV7Q7LV","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"47QDOFHE","created_at":"2026-05-18T12:28:14.216126+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/47QDOFHEYAV7Q7LVP7V222FMQS","json":"https://pith.science/pith/47QDOFHEYAV7Q7LVP7V222FMQS.json","graph_json":"https://pith.science/api/pith-number/47QDOFHEYAV7Q7LVP7V222FMQS/graph.json","events_json":"https://pith.science/api/pith-number/47QDOFHEYAV7Q7LVP7V222FMQS/events.json","paper":"https://pith.science/paper/47QDOFHE"},"agent_actions":{"view_html":"https://pith.science/pith/47QDOFHEYAV7Q7LVP7V222FMQS","download_json":"https://pith.science/pith/47QDOFHEYAV7Q7LVP7V222FMQS.json","view_paper":"https://pith.science/paper/47QDOFHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3654&json=true","fetch_graph":"https://pith.science/api/pith-number/47QDOFHEYAV7Q7LVP7V222FMQS/graph.json","fetch_events":"https://pith.science/api/pith-number/47QDOFHEYAV7Q7LVP7V222FMQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47QDOFHEYAV7Q7LVP7V222FMQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47QDOFHEYAV7Q7LVP7V222FMQS/action/storage_attestation","attest_author":"https://pith.science/pith/47QDOFHEYAV7Q7LVP7V222FMQS/action/author_attestation","sign_citation":"https://pith.science/pith/47QDOFHEYAV7Q7LVP7V222FMQS/action/citation_signature","submit_replication":"https://pith.science/pith/47QDOFHEYAV7Q7LVP7V222FMQS/action/replication_record"}},"created_at":"2026-05-18T03:02:08.059625+00:00","updated_at":"2026-05-18T03:02:08.059625+00:00"}