{"id":"https://openalex.org/W2083187712","doi":"https://doi.org/10.1287/opre.42.1.102","title":"New Lower and Upper Bounds for Scheduling Around a Small Common Due Date","display_name":"New Lower and Upper Bounds for Scheduling Around a Small Common Due Date","publication_year":1994,"publication_date":"1994-02-01","ids":{"openalex":"https://openalex.org/W2083187712","doi":"https://doi.org/10.1287/opre.42.1.102","mag":"2083187712"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.42.1.102","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/files/6764631/Hoogeveen94new.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007204231","display_name":"J.A. Hoogeveen","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"funder","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"J. A. Hoogeveen","raw_affiliation_strings":["Eindhoven University of Technology , Eindhoven , The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology , Eindhoven , The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040353938","display_name":"H. Oosterhout","orcid":null},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"funder","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"H. Oosterhout","raw_affiliation_strings":["Tilburg University, Tilburg, the Netherlands."],"affiliations":[{"raw_affiliation_string":"Tilburg University, Tilburg, the Netherlands.","institution_ids":["https://openalex.org/I193700539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009663049","display_name":"Steef van de Velde","orcid":"https://orcid.org/0009-0001-3549-8684"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"funder","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"S. L. van de Velde","raw_affiliation_strings":["University of Twente, Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.144,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.936547,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":90},"biblio":{"volume":"42","issue":"1","first_page":"102","last_page":"110"},"is_retracted":false,"is_paratext":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/T12288","display_name":"Optimization and Search Problems","score":0.9987,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9969,"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/branch-and-bound","display_name":"Branch and bound","score":0.4338407}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7859621},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.60523456},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5571494},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.5112083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5096226},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.49951172},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46067557},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4338407},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4117605},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3270952},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.18918893},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.42.1.102","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/cf585291-015e-438f-a158-0fd9016debd8","pdf_url":"https://research.utwente.nl/files/6764631/Hoogeveen94new.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://ris.utwente.nl/ws/files/6764631/Hoogeveen94new.pdf","pdf_url":"https://ris.utwente.nl/ws/files/6764631/Hoogeveen94new.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/cf585291-015e-438f-a158-0fd9016debd8","pdf_url":"https://research.utwente.nl/files/6764631/Hoogeveen94new.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.68,"id":"https://metadata.un.org/sdg/8"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":9,"referenced_works":["https://openalex.org/W1964307274","https://openalex.org/W2040924621","https://openalex.org/W2056177557","https://openalex.org/W2067480095","https://openalex.org/W2090484759","https://openalex.org/W2091164478","https://openalex.org/W2093563804","https://openalex.org/W2124388232","https://openalex.org/W2134958868"],"related_works":["https://openalex.org/W4319942994","https://openalex.org/W2753563621","https://openalex.org/W2752454479","https://openalex.org/W2389899617","https://openalex.org/W2366206435","https://openalex.org/W2350519135","https://openalex.org/W2182290077","https://openalex.org/W1987895267","https://openalex.org/W1968337573","https://openalex.org/W1931020284"],"abstract_inverted_index":{"We":[0,52,122],"consider":[1],"the":[2,11,14,17,57,87,95,98,130],"single-machine":[3],"problem":[4,116],"of":[5,13,16,117],"scheduling":[6],"n":[7,72,91],"jobs":[8],"to":[9,65,120],"minimize":[10],"sum":[12],"deviations":[15],"job":[18],"completion":[19],"times":[20,81],"from":[21,83],"a":[22,34,84,105,114,125],"given":[23],"small":[24,118],"common":[25],"due":[26],"date.":[27],"For":[28,94],"this":[29],"NP-hard":[30],"problem,":[31],"we":[32,103],"develop":[33,124],"branch-and-bound":[35],"algorithm":[36,127],"based":[37,128],"on":[38],"Lagrangian":[39,131],"lower":[40,107],"and":[41],"upper":[42,132],"bounds":[43,58,88,99],"that":[44,109],"are":[45],"found":[46],"in":[47],"O(n":[48],"log":[49],"n)":[50],"time.":[51],"identify":[53],"conditions":[54,61],"under":[55],"which":[56],"concur;":[59],"these":[60],"can":[62],"be":[63,66],"expected":[64],"satisfied":[67],"by":[68,112],"many":[69],"instances":[70],"with":[71,79],"not":[73,101],"too":[74],"small.":[75],"In":[76],"our":[77],"experiments":[78],"processing":[80],"drawn":[82],"uniform":[85],"distribution,":[86],"concur":[89],"for":[90],"\u2265":[92],"40.":[93],"case":[96],"where":[97],"do":[100],"concur,":[102],"present":[104],"refined":[106],"bound":[108],"is":[110],"obtained":[111],"solving":[113],"subset-sum":[115],"dimension":[119],"optimality.":[121],"further":[123],"4/3-approximation":[126],"upon":[129],"bound.":[133]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2083187712","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-02-24T01:49:56.805903","created_date":"2016-06-24"}