{"id":"https://openalex.org/W2533363964","doi":"https://doi.org/10.1109/cipls.2014.7007158","title":"Common due-window problem: Polynomial algorithms for a given processing sequence","display_name":"Common due-window problem: Polynomial algorithms for a given processing sequence","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2533363964","doi":"https://doi.org/10.1109/cipls.2014.7007158","mag":"2533363964"},"language":"en","primary_location":{"id":"doi:10.1109/cipls.2014.7007158","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipls.2014.7007158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","raw_type":"proceedings-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/A5108037732","display_name":"Abhishek Awasthi","orcid":"https://orcid.org/0000-0003-4880-9733"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Abhishek Awasthi","raw_affiliation_strings":["Department of Computer Science, University of Applied Sciences, G\u00f6rlitz, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Applied Sciences, G\u00f6rlitz, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070078806","display_name":"J\u00f6rg L\u00e4ssig","orcid":"https://orcid.org/0000-0002-3169-3802"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jorg Lassig","raw_affiliation_strings":["Department of Computer Science, University of Applied Sciences, G\u00f6rlitz, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Applied Sciences, G\u00f6rlitz, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103020462","display_name":"Oliver Kr\u00e4mer","orcid":"https://orcid.org/0000-0001-7607-1700"},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Oliver Kramer","raw_affiliation_strings":["Department of Computing Science, University of Oldenburg, Oldenburg, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Oldenburg, Oldenburg, Germany","institution_ids":["https://openalex.org/I129877168"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010827013","display_name":"Thomas Weise","orcid":"https://orcid.org/0000-0002-9687-8509"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Thomas Weise","raw_affiliation_strings":["School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5108037732"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.624,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.794516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"41","issue":null,"first_page":"32","last_page":"39"},"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.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/T12176","display_name":"Optimization and Packing Problems","score":0.9866999983787537,"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/tardiness","display_name":"Tardiness","score":0.854712724685669},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.67995285987854},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.6719702482223511},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6575788259506226},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5983802676200867},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5606409907341003},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.5545356869697571},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5512996315956116},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4859263002872467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35288161039352417},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3394082188606262},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3081457316875458},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.30587589740753174}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.854712724685669},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.67995285987854},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.6719702482223511},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6575788259506226},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5983802676200867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5606409907341003},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.5545356869697571},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5512996315956116},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4859263002872467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35288161039352417},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3394082188606262},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3081457316875458},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.30587589740753174},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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.1109/cipls.2014.7007158","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipls.2014.7007158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.698.8476","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.8476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.it-weise.de/documents/files/ALKW2014CDWPPAFAGPS.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5199999809265137}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320328735","display_name":"Freistaat Sachsen","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W103401832","https://openalex.org/W571706939","https://openalex.org/W1489057693","https://openalex.org/W1559395942","https://openalex.org/W1964408737","https://openalex.org/W1981864328","https://openalex.org/W1989533809","https://openalex.org/W1990303140","https://openalex.org/W1996112788","https://openalex.org/W2002094842","https://openalex.org/W2002352006","https://openalex.org/W2024308282","https://openalex.org/W2043295707","https://openalex.org/W2049832273","https://openalex.org/W2056177557","https://openalex.org/W2059067336","https://openalex.org/W2062701203","https://openalex.org/W2091164478","https://openalex.org/W2092514695","https://openalex.org/W2099141551","https://openalex.org/W2106345627","https://openalex.org/W2117416910","https://openalex.org/W2118591900","https://openalex.org/W2124388232","https://openalex.org/W2129524229","https://openalex.org/W2130501349","https://openalex.org/W2163356637","https://openalex.org/W2963356083","https://openalex.org/W3100722911"],"related_works":["https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W1992259816","https://openalex.org/W2060337406","https://openalex.org/W180477571","https://openalex.org/W4381616416","https://openalex.org/W2044253754","https://openalex.org/W3157291475","https://openalex.org/W2153799489"],"abstract_inverted_index":{"The":[0,36,120],"paper":[1],"considers":[2],"the":[3,39,44,53,56,61,71,90,102,114,128,145,151,157,173],"Common":[4],"Due-Window":[5],"(CDW)":[6],"problem":[7,40],"where":[8,99],"a":[9,13,19,81,86,123],"single":[10,87],"machine":[11,88],"processes":[12],"certain":[14],"number":[15,103],"of":[16,38,47,55,70,93,104,126,183],"jobs":[17,129],"against":[18],"common":[20],"due-window.":[21],"Each":[22],"job":[23,83],"possesses":[24],"different":[25,29,188],"processing":[26,45,118,175],"times":[27,51],"but":[28],"and":[30,33,52,68,143,185],"asymmetric":[31],"earliness":[32,69],"tardiness":[34,67],"penalties.":[35],"objective":[37],"is":[41,101],"to":[42,59,66,171],"find":[43],"sequence":[46,84,124],"jobs,":[48],"their":[49],"completion":[50,147],"position":[54],"given":[57,82],"due-window":[58,189],"minimize":[60],"total":[62,154],"penalty":[63,155],"incurred":[64],"due":[65],"jobs.":[72,105],"This":[73],"work":[74],"presents":[75],"exact":[76],"polynomial":[77,163],"algorithms":[78,121,164],"for":[79,85,112,156,187],"optimizing":[80,113],"with":[89,116,167,181],"run-time":[91],"complexity":[92],"O(n":[94],"<sup":[95],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[96,132],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[97],"),":[98],"n":[100],"We":[106,177],"also":[107],"provide":[108],"an":[109],"O(n)":[110],"algorithm":[111],"CDW":[115],"unit":[117],"times.":[119],"take":[122],"consisting":[125],"all":[127],"(J":[130],"<sub":[131],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</sub>":[133],",":[134],"i":[135],"=":[136],"1,":[137],"2,":[138],"...,":[139],"n)":[140],"as":[141],"input":[142],"return":[144],"optimal":[146],"times,":[148],"which":[149],"offers":[150],"minimum":[152],"possible":[153],"sequence.":[158,176],"Furthermore,":[159],"we":[160],"implement":[161],"our":[162,179],"in":[165],"conjunction":[166],"Simulated":[168],"Annealing":[169],"(SA)":[170],"obtain":[172],"best":[174],"compare":[178],"results":[180],"that":[182],"Biskup":[184],"Feldmann":[186],"lengths.":[190]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}