{"id":"https://openalex.org/W2097153213","doi":"https://doi.org/10.1007/3-540-44829-2_1","title":"Optimal Scheduling Using Branch and Bound with SPIN 4.0","display_name":"Optimal Scheduling Using Branch and Bound with SPIN 4.0","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2097153213","doi":"https://doi.org/10.1007/3-540-44829-2_1","mag":"2097153213"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44829-2_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44829-2_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/70f0b297-6aef-4e2f-83c5-f0780cc1dfaa","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108074404","display_name":"Theo C. Ruys","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Theo C. Ruys","raw_affiliation_strings":["Department of Computer Science, University of Twente, P. O. Box 217, 7500 AE, Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Twente, P. O. Box 217, 7500 AE, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108074404"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.1849,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.91537026,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9785000085830688,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9659000039100647,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/promela","display_name":"Promela","score":0.9835280776023865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7955619692802429},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.708747148513794},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6283824443817139},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5913239121437073},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5742306113243103},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4723459482192993},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4545454680919647},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34176892042160034},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31322282552719116},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1520741581916809}],"concepts":[{"id":"https://openalex.org/C2776329536","wikidata":"https://www.wikidata.org/wiki/Q948666","display_name":"Promela","level":3,"score":0.9835280776023865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7955619692802429},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.708747148513794},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6283824443817139},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5913239121437073},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5742306113243103},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4723459482192993},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4545454680919647},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34176892042160034},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31322282552719116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1520741581916809},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/3-540-44829-2_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44829-2_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:ris.utwente.nl:openaire/70f0b297-6aef-4e2f-83c5-f0780cc1dfaa","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/70f0b297-6aef-4e2f-83c5-f0780cc1dfaa","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ruys, T C 2003, Optimal Scheduling Using Branch and Bound with SPIN 4.0. in T Ball & S K Rajamani (eds), Model Checking Software : 10th International SPIN Workshop Portland, OR, USA, May 9\u201310, 2003 Proceedings. Lecture Notes in Computer Science, vol. 2648, Berlin, Heidelberg, pp. 1-17, 10th International SPIN Workshop on Model Checking Software 2003, Portland, Oregon, United States, 9/05/03. https://doi.org/10.1007/3-540-44829-2_1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.6387","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6387","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://spinroot.com/spin/Workshops/ws03/Ruys.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.463.8000","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.463.8000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprints.eemcs.utwente.nl/6541/01/ruys-spin-2003.pdf","raw_type":"text"},{"id":"pmh:oai:ris.utwente.nl:publications/70f0b297-6aef-4e2f-83c5-f0780cc1dfaa","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/70f0b297-6aef-4e2f-83c5-f0780cc1dfaa","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/70f0b297-6aef-4e2f-83c5-f0780cc1dfaa","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ruys, T C 2003, Optimal Scheduling Using Branch and Bound with SPIN 4.0. in T Ball & S K Rajamani (eds), Model Checking Software : 10th International SPIN Workshop Portland, OR, USA, May 9\u201310, 2003 Proceedings. Lecture Notes in Computer Science, vol. 2648, Berlin, Heidelberg, pp. 1-17, 10th International SPIN Workshop on Model Checking Software 2003, Portland, Oregon, United States, 9/05/03. https://doi.org/10.1007/3-540-44829-2_1","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W68069235","https://openalex.org/W1501175088","https://openalex.org/W1539432158","https://openalex.org/W1561761856","https://openalex.org/W1578477039","https://openalex.org/W1605437280","https://openalex.org/W1820192350","https://openalex.org/W1878516677","https://openalex.org/W1900874134","https://openalex.org/W1943502734","https://openalex.org/W1977553951","https://openalex.org/W2113043717","https://openalex.org/W2115309705","https://openalex.org/W2130664212","https://openalex.org/W2131983024","https://openalex.org/W2136199343","https://openalex.org/W2146446489","https://openalex.org/W2164989576","https://openalex.org/W2168099541","https://openalex.org/W2912102632","https://openalex.org/W2944593666","https://openalex.org/W3135604143","https://openalex.org/W4234244433","https://openalex.org/W4289868901","https://openalex.org/W6634675260","https://openalex.org/W6684313409","https://openalex.org/W6986868657"],"related_works":["https://openalex.org/W2140364234","https://openalex.org/W1538854713","https://openalex.org/W1481983260","https://openalex.org/W1504525241","https://openalex.org/W3146005941","https://openalex.org/W2556172256","https://openalex.org/W2363827478","https://openalex.org/W20172544","https://openalex.org/W4387577136","https://openalex.org/W4297785302"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}