{"id":"https://openalex.org/W3036075539","doi":"https://doi.org/10.1080/00207543.2020.1777481","title":"Identical parallel machine scheduling with discrete additional resource and an application in audit scheduling","display_name":"Identical parallel machine scheduling with discrete additional resource and an application in audit scheduling","publication_year":2020,"publication_date":"2020-06-17","ids":{"openalex":"https://openalex.org/W3036075539","doi":"https://doi.org/10.1080/00207543.2020.1777481","mag":"3036075539"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2020.1777481","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2020.1777481","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","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"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/A5032006091","display_name":"Ethem \u00c7anako\u011flu","orcid":"https://orcid.org/0000-0002-2572-1985"},"institutions":[{"id":"https://openalex.org/I128277893","display_name":"Bah\u00e7e\u015fehir University","ror":"https://ror.org/00yze4d93","country_code":"TR","type":"education","lineage":["https://openalex.org/I128277893"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Ethem \u00c7anako\u011flu","raw_affiliation_strings":["Department of Industrial Engineering, Bah\u00e7e\u015fehir University, \u0130stanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Bah\u00e7e\u015fehir University, \u0130stanbul, Turkey","institution_ids":["https://openalex.org/I128277893"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051731448","display_name":"\u0130brahim Muter","orcid":"https://orcid.org/0000-0003-2202-4751"},"institutions":[{"id":"https://openalex.org/I51601045","display_name":"University of Bath","ror":"https://ror.org/002h8g185","country_code":"GB","type":"education","lineage":["https://openalex.org/I51601045"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"\u0130brahim Muter","raw_affiliation_strings":["School of Management, University of Bath, Bath, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Management, University of Bath, Bath, UK","institution_ids":["https://openalex.org/I51601045"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032006091"],"corresponding_institution_ids":["https://openalex.org/I128277893"],"apc_list":null,"apc_paid":null,"fwci":1.7128,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.86194403,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"59","issue":"17","first_page":"5321","last_page":"5336"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9958000183105469,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9876999855041504,"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/computer-science","display_name":"Computer science","score":0.6996679902076721},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.5963186025619507},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5824446678161621},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.529466986656189},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5197296142578125},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5157175660133362},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.46304041147232056},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4607445001602173},{"id":"https://openalex.org/keywords/audit","display_name":"Audit","score":0.43940505385398865},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43749889731407166},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.4174595773220062},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3718240261077881},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3062514364719391},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14577537775039673},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.10114365816116333},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09599992632865906}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6996679902076721},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.5963186025619507},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5824446678161621},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.529466986656189},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5197296142578125},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5157175660133362},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.46304041147232056},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4607445001602173},{"id":"https://openalex.org/C199521495","wikidata":"https://www.wikidata.org/wiki/Q181487","display_name":"Audit","level":2,"score":0.43940505385398865},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43749889731407166},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.4174595773220062},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3718240261077881},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3062514364719391},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14577537775039673},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10114365816116333},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09599992632865906},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207543.2020.1777481","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2020.1777481","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","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"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:59:y:2021:i:17:p:5321-5336","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2020.1777481","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":[{"score":0.6100000143051147,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G3552628166","display_name":"B\u00fct\u00fcnle\u00b8sik\u02d9I \u00b8sg\u00fcc\u00fc ve G\u00f6rev \u00c7izelgeleme Problemleri","funder_award_id":"115M544","funder_id":"https://openalex.org/F4320322626","funder_display_name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu"}],"funders":[{"id":"https://openalex.org/F4320322626","display_name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","ror":"https://ror.org/04w9kkr77"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W63138072","https://openalex.org/W73479046","https://openalex.org/W129851918","https://openalex.org/W844631126","https://openalex.org/W1488422606","https://openalex.org/W1495834223","https://openalex.org/W1974726713","https://openalex.org/W1976855204","https://openalex.org/W1981549570","https://openalex.org/W2011524448","https://openalex.org/W2024742034","https://openalex.org/W2038746019","https://openalex.org/W2044121814","https://openalex.org/W2050903604","https://openalex.org/W2052841853","https://openalex.org/W2058193654","https://openalex.org/W2063959439","https://openalex.org/W2086992555","https://openalex.org/W2087245794","https://openalex.org/W2093113778","https://openalex.org/W2106531106","https://openalex.org/W2111581650","https://openalex.org/W2112788256","https://openalex.org/W2123696861","https://openalex.org/W2142874101","https://openalex.org/W2255734301","https://openalex.org/W2577909561","https://openalex.org/W2782416223","https://openalex.org/W2887704695","https://openalex.org/W4247245376"],"related_works":["https://openalex.org/W2155809154","https://openalex.org/W4382280829","https://openalex.org/W2741059494","https://openalex.org/W2949165180","https://openalex.org/W2533899164","https://openalex.org/W2838819579","https://openalex.org/W2057737420","https://openalex.org/W131757205","https://openalex.org/W2596081411","https://openalex.org/W2113884669"],"abstract_inverted_index":{"Resource":[0],"scheduling":[1,31,46,95,141],"has":[2],"been":[3],"one":[4],"of":[5,27,54,66,73,85,101,112,120,138,196],"the":[6,28,55,61,86,121,125,139,148,194,197],"most":[7],"prominent":[8],"problems":[9,157],"due":[10],"to":[11,76,106,131,147,192],"its":[12],"technical":[13],"challenges":[14],"and":[15,124,158,176],"prevalence":[16],"in":[17,91,97],"real-life.":[18],"In":[19],"this":[20,74,133],"paper,":[21],"we":[22,57],"focus":[23],"on":[24],"an":[25,136,177],"extension":[26,137],"parallel":[29,44],"machine":[30,45],"problem":[32,47,56,134,142],"with":[33,48,68,114,143],"additional":[34,62,87],"resources,":[35],"which":[36,98],"can":[37],"be":[38,107],"classified":[39],"as":[40,135],"a":[41,92,102,110,173],"static":[42],"resource-constrained":[43],"unspecified":[49],"job-machine":[50],"assignment.":[51],"The":[52,71,118,163],"novelty":[53],"tackle":[58],"stems":[59],"from":[60],"resource":[63,75,88],"that":[64],"consists":[65],"components":[67],"discrete":[69],"levels.":[70,117],"allocation":[72],"machines":[77],"induces":[78],"general":[79],"covering":[80],"constraints.":[81],"This":[82],"distinct":[83],"characteristic":[84],"also":[89],"arises":[90],"real-life":[93],"audit":[94],"problem,":[96],"local":[99],"branches":[100],"financial":[103],"firm":[104],"are":[105,170],"audited":[108],"by":[109,167,172],"set":[111],"auditors":[113],"different":[115],"experience":[116,123,127],"quantification":[119],"auditor":[122],"branch":[126],"requirement":[128],"enable":[129],"us":[130],"model":[132],"aforementioned":[140],"extra":[144],"constraints":[145],"related":[146],"auditing":[149],"process.":[150],"We":[151,187],"propose":[152],"mathematical":[153],"models":[154],"for":[155,184],"these":[156,168],"two":[159],"constructive":[160],"heuristic":[161],"algorithms.":[162,199],"upper":[164],"bounds":[165],"attained":[166],"algorithms":[169],"improved":[171],"tabu-search":[174],"algorithm,":[175],"efficient":[178],"lower":[179],"bounding":[180],"technique":[181],"is":[182],"developed":[183],"comparative":[185],"purposes.":[186],"conduct":[188],"extensive":[189],"computational":[190],"experiments":[191],"assess":[193],"performance":[195],"proposed":[198]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4}],"updated_date":"2026-08-19T15:00:24.278416","created_date":"2025-10-10T00:00:00"}