{"id":"https://openalex.org/W2767608946","doi":"https://doi.org/10.1080/00207543.2017.1397794","title":"A tutorial of integrating duality and branch and bound in earliness\u2013tardiness scheduling with idle insertion time problems","display_name":"A tutorial of integrating duality and branch and bound in earliness\u2013tardiness scheduling with idle insertion time problems","publication_year":2017,"publication_date":"2017-11-07","ids":{"openalex":"https://openalex.org/W2767608946","doi":"https://doi.org/10.1080/00207543.2017.1397794","mag":"2767608946"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2017.1397794","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2017.1397794","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},"type":"article","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/A5076226862","display_name":"Michael F. Gorman","orcid":"https://orcid.org/0000-0003-1295-8147"},"institutions":[{"id":"https://openalex.org/I127591826","display_name":"University of Dayton","ror":"https://ror.org/021v3qy27","country_code":"US","type":"education","lineage":["https://openalex.org/I127591826"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael F. Gorman","raw_affiliation_strings":["Department of MIS/OM/DSC, School of Business, University of Dayton","Department of MIS/OM/DSC, School of Business, University of Dayton, Dayton, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of MIS/OM/DSC, School of Business, University of Dayton","institution_ids":["https://openalex.org/I127591826"]},{"raw_affiliation_string":"Department of MIS/OM/DSC, School of Business, University of Dayton, Dayton, OH, USA","institution_ids":["https://openalex.org/I127591826"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083511110","display_name":"Daniel G. Conway","orcid":"https://orcid.org/0000-0001-5814-3088"},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]},{"id":"https://openalex.org/I4210133369","display_name":"Decision Sciences (United States)","ror":"https://ror.org/03gcvf773","country_code":"US","type":"company","lineage":["https://openalex.org/I4210133369"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel G. Conway","raw_affiliation_strings":["Department of Information Systems, Decision Sciences, Muma College of Business, University of South Florida","Department of Information Systems, Decision Sciences, Muma College of Business, University of South Florida, Tampa, FL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Information Systems, Decision Sciences, Muma College of Business, University of South Florida","institution_ids":["https://openalex.org/I4210133369"]},{"raw_affiliation_string":"Department of Information Systems, Decision Sciences, Muma College of Business, University of South Florida, Tampa, FL, USA","institution_ids":["https://openalex.org/I2613432","https://openalex.org/I4210133369"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076226862"],"corresponding_institution_ids":["https://openalex.org/I127591826"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.2191701,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"56","issue":"1-2","first_page":"262","last_page":"277"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9916999936103821,"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.9878000020980835,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.8616901636123657},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6939300894737244},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6793767213821411},{"id":"https://openalex.org/keywords/idle","display_name":"Idle","score":0.6521435976028442},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6041882038116455},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5889706015586853},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5460226535797119},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5096292495727539},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5018916130065918},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.46775221824645996},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.43068018555641174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3604793846607208},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3251349925994873}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8616901636123657},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6939300894737244},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6793767213821411},{"id":"https://openalex.org/C16320812","wikidata":"https://www.wikidata.org/wiki/Q1812200","display_name":"Idle","level":2,"score":0.6521435976028442},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6041882038116455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5889706015586853},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5460226535797119},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5096292495727539},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5018916130065918},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.46775221824645996},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.43068018555641174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3604793846607208},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3251349925994873},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207543.2017.1397794","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2017.1397794","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:56:y:2018:i:1-2:p:262-277","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2017.1397794","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W5599802","https://openalex.org/W1944441789","https://openalex.org/W1974795441","https://openalex.org/W1980885413","https://openalex.org/W1983923832","https://openalex.org/W1988182110","https://openalex.org/W1989343205","https://openalex.org/W2004330396","https://openalex.org/W2013545174","https://openalex.org/W2017648048","https://openalex.org/W2038888256","https://openalex.org/W2073187409","https://openalex.org/W2073508625","https://openalex.org/W2075965427","https://openalex.org/W2076032781","https://openalex.org/W2084960320","https://openalex.org/W2087411299","https://openalex.org/W2093563804","https://openalex.org/W2107682017","https://openalex.org/W2124938557","https://openalex.org/W2171103562","https://openalex.org/W2171157049","https://openalex.org/W2182741893","https://openalex.org/W2554975820","https://openalex.org/W2561796286","https://openalex.org/W2599190760","https://openalex.org/W2625268316","https://openalex.org/W4247609441"],"related_works":["https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W2024604250","https://openalex.org/W2243328125","https://openalex.org/W2051889693","https://openalex.org/W2002220688","https://openalex.org/W1977417896","https://openalex.org/W2077610132","https://openalex.org/W4230124487"],"abstract_inverted_index":{"We":[0,24,117,132,155],"present":[1],"a":[2,20,35,68,108,123,162],"conceptual":[3],"tutorial":[4,121],"of":[5,8,15,37,54,62,87,98,110,126,149],"the":[6,9,26,48,52,60,88,96,99,139,147,158],"value":[7],"dual":[10,97,130,159],"representation":[11],"to":[12,50,81,152,167],"branching":[13,127],"strategies":[14],"idle":[16,43,72,100],"insertion":[17,74,102],"time":[18,44,73,101],"in":[19,32,135,171],"single-machine":[21],"scheduling":[22,29,169],"problem.":[23],"consider":[25],"problem":[27,75,103],"where":[28],"generally":[30],"occurs":[31],"two":[33],"phases:":[34],"sequence":[36,61],"activities":[38],"is":[39,45,64,76,161],"first":[40,66],"determined,":[41],"then":[42],"inserted":[46],"into":[47],"schedule":[49],"minimise":[51],"sum":[53],"early":[55],"and":[56,84,164],"tardy":[57],"costs.":[58],"Typically,":[59],"jobs":[63],"determined":[65],"using":[67],"heuristic":[69,153],"method.":[70],"The":[71],"solved":[77],"via":[78],"linear":[79],"programming":[80],"establish":[82],"starting":[83],"ending":[85],"times":[86],"activities.":[89],"In":[90],"this":[91],"paper,":[92],"we":[93],"show":[94],"how":[95],"can":[104,142],"be":[105,143],"used":[106],"as":[107],"means":[109],"generating":[111],"insights":[112],"for":[113],"earliness\u2013tardiness":[114],"sequencing":[115],"algorithms.":[116],"provide":[118],"an":[119],"extended":[120],"on":[122,129],"new":[124],"way":[125,166],"based":[128],"information.":[131],"find":[133],"that":[134,157],"our":[136],"simple":[137],"examples,":[138],"search":[140],"space":[141],"vastly":[144],"reduced,":[145],"improving":[146],"feasibility":[148],"branch-and-bound":[150],"improvements":[151],"solutions.":[154],"suggest":[156],"approach":[160],"useful":[163],"intuitive":[165],"improve":[168],"solutions":[170],"short":[172],"order.":[173]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-24T08:23:43.765630","created_date":"2025-10-10T00:00:00"}