{"id":"https://openalex.org/W2014986311","doi":"https://doi.org/10.1016/s0166-218x(99)00015-3","title":"A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags","display_name":"A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags","publication_year":1999,"publication_date":"1999-05-01","ids":{"openalex":"https://openalex.org/W2014986311","doi":"https://doi.org/10.1016/s0166-218x(99)00015-3","mag":"2014986311"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(99)00015-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(99)00015-3","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ris.utwente.nl/ws/files/134700383/branch.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000179258","display_name":"Peter Brucker","orcid":null},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Peter Brucker","raw_affiliation_strings":["Universit\u00e4t Osnabr\u00fcck, Fachbereich Mathematik/Informatik, Postfach 4469 D-49069 Osnabr\u00fcck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Osnabr\u00fcck, Fachbereich Mathematik/Informatik, Postfach 4469 D-49069 Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074807479","display_name":"Thomas Hilbig","orcid":null},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Hilbig","raw_affiliation_strings":["Universit\u00e4t Osnabr\u00fcck, Fachbereich Mathematik/Informatik, Postfach 4469 D-49069 Osnabr\u00fcck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Osnabr\u00fcck, Fachbereich Mathematik/Informatik, Postfach 4469 D-49069 Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001577619","display_name":"Johann L. Hurink","orcid":"https://orcid.org/0000-0001-6986-5633"},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Johann Hurink","raw_affiliation_strings":["Universit\u00e4t Osnabr\u00fcck, Fachbereich Mathematik/Informatik, Postfach 4469 D-49069 Osnabr\u00fcck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Osnabr\u00fcck, Fachbereich Mathematik/Informatik, Postfach 4469 D-49069 Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000179258"],"corresponding_institution_ids":["https://openalex.org/I170658231"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":4.2507,"has_fulltext":true,"cited_by_count":58,"citation_normalized_percentile":{"value":0.93088135,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"94","issue":"1-3","first_page":"77","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9926000237464905,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9853000044822693,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/changeover","display_name":"Changeover","score":0.901522159576416},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6062009334564209},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.5995370745658875},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.546416699886322},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5367072820663452},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4758602976799011},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4533611238002777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4400302767753601},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10683348774909973}],"concepts":[{"id":"https://openalex.org/C2780129190","wikidata":"https://www.wikidata.org/wiki/Q5071912","display_name":"Changeover","level":3,"score":0.901522159576416},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6062009334564209},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.5995370745658875},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.546416699886322},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5367072820663452},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4758602976799011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4533611238002777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4400302767753601},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10683348774909973},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s0166-218x(99)00015-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(99)00015-3","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:publications/bc392f8c-a506-4e94-9bd7-34a88fad8e11","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/bc392f8c-a506-4e94-9bd7-34a88fad8e11","pdf_url":"https://ris.utwente.nl/ws/files/134700383/branch.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brucker, P, Hilbig, T & Hurink, J L 1999, 'A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags', Discrete applied mathematics, no. 94, pp. 77-99. https://doi.org/10.1016/S0166-218X(99)00015-3","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:publications/bc392f8c-a506-4e94-9bd7-34a88fad8e11","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:ut:oai:ris.utwente.nl:publications/df03af58-bcbf-452d-9cf6-3f921e09af9d","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/a-branch-and-bound-algorithm-for-a-singlemachine-scheduling-problem-with-positive-and-negative-timelags(df03af58-bcbf-452d-9cf6-3f921e09af9d).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete applied mathematics, 94(1-3), 77 - 99. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:publications/bc392f8c-a506-4e94-9bd7-34a88fad8e11","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/bc392f8c-a506-4e94-9bd7-34a88fad8e11","pdf_url":"https://ris.utwente.nl/ws/files/134700383/branch.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brucker, P, Hilbig, T & Hurink, J L 1999, 'A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags', Discrete applied mathematics, no. 94, pp. 77-99. https://doi.org/10.1016/S0166-218X(99)00015-3","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4399999976158142,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2014986311.pdf","grobid_xml":"https://content.openalex.org/works/W2014986311.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W131323155","https://openalex.org/W1588382077","https://openalex.org/W1968409452","https://openalex.org/W1969199287","https://openalex.org/W1986769982","https://openalex.org/W2011769265","https://openalex.org/W2015241450","https://openalex.org/W2028826326","https://openalex.org/W2038534673","https://openalex.org/W2040296085","https://openalex.org/W2041252124","https://openalex.org/W2086943602","https://openalex.org/W2095273740","https://openalex.org/W2105390489","https://openalex.org/W2130272456","https://openalex.org/W2132709136","https://openalex.org/W2135507920","https://openalex.org/W2156391157","https://openalex.org/W3036035835","https://openalex.org/W4236129682","https://openalex.org/W4246060548","https://openalex.org/W4285719527","https://openalex.org/W6605281107","https://openalex.org/W6779748562"],"related_works":["https://openalex.org/W2009743672","https://openalex.org/W3204654320","https://openalex.org/W2042676286","https://openalex.org/W2127199806","https://openalex.org/W1974309933","https://openalex.org/W2092240563","https://openalex.org/W2094800167","https://openalex.org/W2898780166","https://openalex.org/W1993477581","https://openalex.org/W2390182138"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}