{"id":"https://openalex.org/W2733207190","doi":"https://doi.org/10.1057/s41274-017-0253-0","title":"Minmax common due-window assignment and scheduling on a single machine with two competing agents","display_name":"Minmax common due-window assignment and scheduling on a single machine with two competing agents","publication_year":2017,"publication_date":"2017-07-03","ids":{"openalex":"https://openalex.org/W2733207190","doi":"https://doi.org/10.1057/s41274-017-0253-0","mag":"2733207190"},"language":"en","primary_location":{"id":"doi:10.1057/s41274-017-0253-0","is_oa":false,"landing_page_url":"https://doi.org/10.1057/s41274-017-0253-0","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,"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"},"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/A5037725647","display_name":"Baruch Mor","orcid":"https://orcid.org/0000-0002-6909-8160"},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Baruch Mor","raw_affiliation_strings":["Department of Economics and Business Administration, Ariel University, Ariel, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Economics and Business Administration, Ariel University, Ariel, Israel","institution_ids":["https://openalex.org/I52170813"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037725647"],"corresponding_institution_ids":["https://openalex.org/I52170813"],"apc_list":null,"apc_paid":null,"fwci":1.5054,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85017685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"69","issue":"4","first_page":"589","last_page":"602"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.7281438112258911},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6442819237709045},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6251739859580994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6190793514251709},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5860879421234131},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5608376264572144},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.5181111693382263},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4963153004646301},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.47168806195259094},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.45424163341522217},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25719326734542847},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.15633052587509155}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.7281438112258911},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6442819237709045},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6251739859580994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6190793514251709},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5860879421234131},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5608376264572144},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.5181111693382263},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4963153004646301},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.47168806195259094},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.45424163341522217},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25719326734542847},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.15633052587509155},{"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/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/s41274-017-0253-0","is_oa":false,"landing_page_url":"https://doi.org/10.1057/s41274-017-0253-0","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,"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":"pmh:oai:RePEc:taf:tjorxx:v:69:y:2018:i:4:p:589-602","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1057/s41274-017-0253-0","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":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6899999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W166751945","https://openalex.org/W425079745","https://openalex.org/W828233508","https://openalex.org/W1895486958","https://openalex.org/W1972414677","https://openalex.org/W2002352006","https://openalex.org/W2003843334","https://openalex.org/W2008118316","https://openalex.org/W2030412460","https://openalex.org/W2031102730","https://openalex.org/W2037522254","https://openalex.org/W2041704707","https://openalex.org/W2045770907","https://openalex.org/W2048580447","https://openalex.org/W2115299891","https://openalex.org/W2117416910","https://openalex.org/W2155047985","https://openalex.org/W2166493458","https://openalex.org/W2222440946","https://openalex.org/W2225647301","https://openalex.org/W2234892146","https://openalex.org/W2258425036","https://openalex.org/W2292255107","https://openalex.org/W2315720050","https://openalex.org/W2403844295","https://openalex.org/W4236796530","https://openalex.org/W4255532933"],"related_works":["https://openalex.org/W2153799489","https://openalex.org/W2060337406","https://openalex.org/W1992259816","https://openalex.org/W2057653555","https://openalex.org/W4381616416","https://openalex.org/W2131482998","https://openalex.org/W4251798786","https://openalex.org/W2377478537","https://openalex.org/W2051555966","https://openalex.org/W1991096018"],"abstract_inverted_index":{"We":[0,39,123],"study":[1],"the":[2,19,24,32,41,58,66,71,75,84,88,92,98,103,116,120,126,129],"classical":[3],"method":[4,130],"of":[5,55,74,87,95,119,131],"common":[6,132],"due-date":[7,16,26],"assignment":[8,17],"and":[9,27,36,51,64],"focus":[10],"on":[11,83,115],"minmax":[12],"objective":[13,20],"functions.":[14],"In":[15,57,91],"problems,":[18,138],"is":[21],"to":[22,44,52,69,79,101,110,128],"find":[23],"optimal":[25],"job":[28],"sequence":[29],"that":[30],"minimize":[31,70,102],"total":[33],"earliness,":[34],"tardiness":[35],"due-date-related":[37],"costs.":[38],"extend":[40],"single-agent":[42],"problem":[43],"a":[45,53],"setting":[46,54,60],"involving":[47],"two":[48],"competing":[49],"agents":[50,62],"multi-agent.":[56],"two-agent":[59],"(herein":[61],"A":[63],"B),":[65],"scheduler":[67,99],"needs":[68,100],"maximum":[72],"cost":[73,86,104,118],"agent":[76,89],"A,":[77],"subject":[78,109],"an":[80,111],"upper":[81,113],"bound":[82,114],"maximal":[85,117],"B.":[90],"general":[93],"model":[94],"multi-agent":[96],"scheduling,":[97],"among":[105],"all":[106,136],"A-type":[107],"agents,":[108],"agent-dependent":[112],"B-type":[121],"agents.":[122],"further":[124],"generalize":[125],"problems":[127],"due-window":[133],"assignment.":[134],"For":[135],"studied":[137],"we":[139],"introduce":[140],"efficient":[141],"polynomial":[142],"time":[143],"solutions.":[144]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}