{"id":"https://openalex.org/W2004274396","doi":"https://doi.org/10.1057/jors.1965.7","title":"A \"Branch-and-Bound\" Algorithm for the Exact Solution of the Three-Machine Scheduling Problem","display_name":"A \"Branch-and-Bound\" Algorithm for the Exact Solution of the Three-Machine Scheduling Problem","publication_year":1965,"publication_date":"1965-03-01","ids":{"openalex":"https://openalex.org/W2004274396","doi":"https://doi.org/10.1057/jors.1965.7","mag":"2004274396"},"language":"en","primary_location":{"id":"doi:10.1057/jors.1965.7","doi":"https://doi.org/10.1057/jors.1965.7","is_oa":false,"landing_page_url":"https://doi.org/10.1057/jors.1965.7","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","erih-plus","fnege-2","jufo-2","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030972515","display_name":"Z. A. \u0141omnicki","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Z. A. Lomnicki","raw_affiliation_strings":["Boulton Paul Aircraft Ltd"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boulton Paul Aircraft Ltd","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5030972515"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":80.2281,"has_fulltext":false,"cited_by_count":261,"citation_normalized_percentile":{"value":0.99905123,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":"16","issue":"1","first_page":"89","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.9369999766349792},{"id":"https://openalex.org/keywords/exact-solutions","display_name":"exact solutions","score":0.875},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.5370000004768372},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.656000018119812}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7123324275016785},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6538369655609131},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6456218957901001},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5919796228408813},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5248249173164368},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5106378197669983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4851139783859253},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4516458213329315},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.43767258524894714},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.41103237867355347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2705547511577606},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.1262354850769043},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/jors.1965.7","doi":"https://doi.org/10.1057/jors.1965.7","is_oa":false,"landing_page_url":"https://doi.org/10.1057/jors.1965.7","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","erih-plus","fnege-2","jufo-2","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"doi:10.2307/3006687","doi":"https://doi.org/10.2307/3006687","is_oa":false,"landing_page_url":"https://doi.org/10.2307/3006687","pdf_url":null,"source":{"id":"https://openalex.org/S4210196068","display_name":"OR","issn_l":"1473-2858","issn":["1473-2858","2397-5342"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"OR","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2001934542","https://openalex.org/W2024085737","https://openalex.org/W2092732888","https://openalex.org/W2123241324"],"related_works":["https://openalex.org/W1974746930","https://openalex.org/W2165832002","https://openalex.org/W2235738023","https://openalex.org/W2071390616","https://openalex.org/W1556005978","https://openalex.org/W2130272456","https://openalex.org/W2145034834","https://openalex.org/W2085201421","https://openalex.org/W367278991","https://openalex.org/W2301649807"],"abstract_inverted_index":{"By":[0],"combining":[1],"Roy's":[2],"graph-theoretical":[3],"interpretation":[4],"of":[5,8,17,44,51,56,67],"the":[6,21,31,41,45,49,57],"problem":[7,34,47],"job":[9],"scheduling":[10,46],"on":[11],"machines":[12],"and":[13,65],"some":[14],"general":[15],"results":[16],"his":[18],"theory":[19],"with":[20],"\u201cbranch-and-bound\u201d":[22],"method":[23],"recently":[24],"applied":[25],"by":[26,62],"Little":[27],"et":[28],"al.":[29],"to":[30],"travelling":[32],"salesman":[33],"an":[35],"algorithm":[36,58],"has":[37,59],"been":[38,60,71],"obtained":[39],"for":[40],"exact":[42],"solution":[43],"in":[48],"case":[50],"three":[52],"machines.":[53],"The":[54],"working":[55],"illustrated":[61],"numerical":[63],"examples":[64],"possibilities":[66],"further":[68],"investigations":[69],"have":[70],"indicated.":[72]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":8}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}