{"id":"https://openalex.org/W3003660902","doi":"https://doi.org/10.1109/iros40897.2019.8967809","title":"Cannot avoid penalty for fluctuating order arrival rate? Let's minimize","display_name":"Cannot avoid penalty for fluctuating order arrival rate? Let's minimize","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W3003660902","doi":"https://doi.org/10.1109/iros40897.2019.8967809","mag":"3003660902"},"language":"en","primary_location":{"id":"doi:10.1109/iros40897.2019.8967809","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros40897.2019.8967809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5071998997","display_name":"Marichi Agarwal","orcid":null},"institutions":[{"id":"https://openalex.org/I4210145666","display_name":"Embedded Systems (United States)","ror":"https://ror.org/04742eh45","country_code":"US","type":"company","lineage":["https://openalex.org/I4210145666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marichi Agarwal","raw_affiliation_strings":["Embedded Systems &#x0026; Robotics division of TCS Research &#x0026; Innovation,India","Embedded Systems & Robotics division of TCS Research & Innovation, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Embedded Systems &#x0026; Robotics division of TCS Research &#x0026; Innovation,India","institution_ids":["https://openalex.org/I4210145666"]},{"raw_affiliation_string":"Embedded Systems & Robotics division of TCS Research & Innovation, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045560127","display_name":"Chayan Sarkar","orcid":"https://orcid.org/0000-0003-4777-2086"},"institutions":[{"id":"https://openalex.org/I4210145666","display_name":"Embedded Systems (United States)","ror":"https://ror.org/04742eh45","country_code":"US","type":"company","lineage":["https://openalex.org/I4210145666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chayan Sarkar","raw_affiliation_strings":["Embedded Systems &#x0026; Robotics division of TCS Research &#x0026; Innovation,India","Embedded Systems & Robotics division of TCS Research & Innovation, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Embedded Systems &#x0026; Robotics division of TCS Research &#x0026; Innovation,India","institution_ids":["https://openalex.org/I4210145666"]},{"raw_affiliation_string":"Embedded Systems & Robotics division of TCS Research & Innovation, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210145666"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.28471812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"7386","last_page":"7393"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","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.9990000128746033,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9976000189781189,"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/computer-science","display_name":"Computer science","score":0.7760670185089111},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6220067143440247},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6205751299858093},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5369695425033569},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5126746892929077},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5057888031005859},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4619240164756775},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4523800015449524},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.44262027740478516},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.44075438380241394},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.43699532747268677},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.417951762676239},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3812071979045868},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3472898006439209},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21180453896522522},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20572251081466675},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0938788652420044},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09194636344909668},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08232271671295166}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7760670185089111},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6220067143440247},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6205751299858093},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5369695425033569},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5126746892929077},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5057888031005859},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4619240164756775},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4523800015449524},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.44262027740478516},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.44075438380241394},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.43699532747268677},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.417951762676239},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3812071979045868},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3472898006439209},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21180453896522522},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20572251081466675},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0938788652420044},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09194636344909668},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08232271671295166},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros40897.2019.8967809","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros40897.2019.8967809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1563127315","https://openalex.org/W1583737895","https://openalex.org/W1972391046","https://openalex.org/W2011039300","https://openalex.org/W2024940818","https://openalex.org/W2028445684","https://openalex.org/W2098200053","https://openalex.org/W2112123182","https://openalex.org/W2113257089","https://openalex.org/W2122846259","https://openalex.org/W2128970394","https://openalex.org/W2138403270","https://openalex.org/W2144944217","https://openalex.org/W2182119443","https://openalex.org/W2476096155","https://openalex.org/W2601109552","https://openalex.org/W2620712696","https://openalex.org/W2808070090","https://openalex.org/W2891489679","https://openalex.org/W2904451840","https://openalex.org/W2968612130","https://openalex.org/W6676602822","https://openalex.org/W6735647534","https://openalex.org/W6752308915"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405"],"abstract_inverted_index":{"Warehouse":[0],"management":[1],"system":[2,109],"assigns":[3],"a":[4,35,65,80,92,108,114,140,147,172,186,196],"preferred":[5],"completion":[6,63],"time":[7],"for":[8,78,107],"every":[9],"order":[10],"based":[11],"on":[12],"the":[13,17,48,54,59,128,158,181],"customer":[14],"profile":[15],"and":[16,117,150],"good(s)":[18],"that":[19,163],"is/are":[20],"ordered.":[21],"Even":[22],"though":[23],"employing":[24],"multi-robot":[25,81,96],"systems":[26],"to":[27,40,167,179,191],"manage":[28],"goods":[29],"movement":[30],"bring":[31],"operational":[32],"efficiency":[33],"in":[34,47],"warehouse,":[36],"it":[37,121,184],"is":[38,122],"difficult":[39,143],"meet":[41],"these":[42],"soft":[43,115],"deadlines":[44],"of":[45,61,95,130,132,175,189],"tasks":[46,134,176],"peak":[49],"hours/seasons.":[50],"This":[51],"can":[52],"impact":[53],"respective":[55],"businesses":[56],"significantly":[57],"as":[58],"lateness":[60],"task":[62,75,97,112,138,153,199],"incurs":[64],"direct/indirect":[66],"penalty.":[67],"In":[68],"this":[69],"work,":[70],"we":[71,161],"develop":[72],"an":[73],"online":[74,152],"scheduling":[76,98,200],"algorithm":[77],"such":[79],"system,":[82],"called":[83],"Online":[84],"Minimum":[85],"Penalty":[86],"Scheduling":[87],"(OMPS).":[88],"Though":[89],"there":[90],"exists":[91],"large":[93],"number":[94,174],"algorithms,":[99],"they":[100],"are":[101,177],"not":[102],"suitable":[103],"(or":[104],"less":[105,169],"efficient)":[106],"where":[110],"each":[111],"has":[113],"deadline":[116],"accumulates":[118],"penalty":[119,170],"if":[120],"executed":[123],"beyond":[124],"its":[125],"deadline.":[126,182],"Moreover,":[127],"lack":[129],"knowledge":[131],"future":[133],"(online":[135],"scheduling)":[136],"makes":[137],"allocation":[139],"much":[141],"more":[142],"job.":[144],"OMPS":[145,164],"provides":[146],"robust,":[148],"scalable,":[149],"near-optimal":[151],"schedule.":[154],"By":[155],"comparing":[156],"with":[157,195],"state-of-the-art":[159,197],"algorithm,":[160],"show":[162],"attracts":[165],"up":[166,190],"78%":[168],"when":[171,193],"significant":[173],"bound":[178],"miss":[180],"Additionally,":[183],"achieves":[185],"competitive":[187],"ratio":[188],"1":[192],"compared":[194],"offline":[198],"algorithm.":[201]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}
