{"id":"https://openalex.org/W2921037686","doi":"https://doi.org/10.5220/0007362700910101","title":"Makespan Minimization with Sequence-dependent Non-overlapping Setups","display_name":"Makespan Minimization with Sequence-dependent Non-overlapping Setups","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2921037686","doi":"https://doi.org/10.5220/0007362700910101","mag":"2921037686"},"language":"en","primary_location":{"id":"doi:10.5220/0007362700910101","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0007362700910101","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0007362700910101","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102879953","display_name":"Marek Vlk","orcid":"https://orcid.org/0000-0003-4925-0812"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]},{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Marek Vlk","raw_affiliation_strings":["Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Czech Republic, Industrial Informatics Department, Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague and Czech Republic, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Czech Republic, Industrial Informatics Department, Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague and Czech Republic, --- Select a Country ---","institution_ids":["https://openalex.org/I21250087","https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052696241","display_name":"Anton\u00edn Nov\u00e1k","orcid":"https://orcid.org/0000-0003-2203-4554"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Antonin Novak","raw_affiliation_strings":["Industrial Informatics Department, Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague, Czech Republic, Department of Control Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague and Czech Republic, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Informatics Department, Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague, Czech Republic, Department of Control Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague and Czech Republic, --- Select a Country ---","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039174863","display_name":"Zden\u011bk Hanz\u00e1lek","orcid":"https://orcid.org/0000-0002-8135-1296"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Zdenek Hanzalek","raw_affiliation_strings":["Industrial Informatics Department, Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague and Czech Republic, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Informatics Department, Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague and Czech Republic, --- Select a Country ---","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.225,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74594914,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"91","last_page":"101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9940000176429749,"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.9940000176429749,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9689000248908997,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.963699996471405,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7793523073196411},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6660586595535278},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6367167234420776},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6343758702278137},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5038403868675232},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.502100944519043},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.481172651052475},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47252967953681946},{"id":"https://openalex.org/keywords/control-reconfiguration","display_name":"Control reconfiguration","score":0.4668577015399933},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4320676028728485},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.42556118965148926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30953162908554077},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.24652928113937378},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22984552383422852}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7793523073196411},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6660586595535278},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6367167234420776},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6343758702278137},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5038403868675232},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.502100944519043},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.481172651052475},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47252967953681946},{"id":"https://openalex.org/C119701452","wikidata":"https://www.wikidata.org/wiki/Q5165881","display_name":"Control reconfiguration","level":2,"score":0.4668577015399933},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4320676028728485},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.42556118965148926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30953162908554077},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.24652928113937378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22984552383422852},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0007362700910101","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0007362700910101","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0007362700910101","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0007362700910101","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/6","score":0.8600000143051147,"display_name":"Clean water and sanitation"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2357657342","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2147600044","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W2014328192","https://openalex.org/W4232431455","https://openalex.org/W2386868101"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3,68,120,145,171],"a":[4,45,74,94,137,159],"scheduling":[5],"problem":[6,67,110],"that":[7,18,97,127],"emerges":[8],"in":[9,105],"the":[10,22,27,31,56,60,66,99,106,112,129,133],"production":[11],"of":[12,15,21,26,33,101,114],"water":[13],"tubes":[14],"different":[16],"sizes":[17],"require":[19],"reconfiguration":[20,25],"machines.":[23],"The":[24,123,162],"machines":[28,147,173],"leads":[29],"to":[30,142,150,156,176],"notion":[32],"sequence-dependent":[34],"setup":[35],"times":[36],"between":[37],"tasks.":[38],"These":[39],"setups":[40,61,70],"are":[41],"often":[42],"performed":[43],"by":[44],"single":[46],"person":[47],"who":[48],"cannot":[49],"serve":[50],"more":[51],"than":[52],"one":[53],"machine":[54,155],"at":[55,117],"same":[57],"moment,":[58],"i.e.,":[59],"must":[62],"not":[63],"overlap.":[64],"Surprisingly,":[65],"non-overlapping":[69],"has":[71],"received":[72],"only":[73],"little":[75],"attention":[76],"so":[77],"far.":[78],"To":[79],"solve":[80,143],"this":[81],"problem,":[82],"we":[83],"propose":[84],"an":[85],"Integer":[86,102],"Linear":[87,103],"Programming":[88,91,104,116,135],"formulation,":[89],"Constraint":[90,115,134],"models":[92],"and":[93,111,148,174],"hybrid":[95,164],"heuristic":[96,165],"leverages":[98],"strength":[100],"shortest":[107],"Hamiltonian":[108],"path":[109],"efficiency":[113],"sequencing":[118],"problems":[119],"makespan":[121],"minimization.":[122],"experimental":[124],"evaluation":[125],"shows":[126],"among":[128],"proposed":[130,163],"exact":[131],"approaches,":[132],"is":[136],"superior":[138],"method":[139],"being":[140],"able":[141],"instances":[144,170],"3":[146],"up":[149,175],"11":[151],"tasks":[152,178],"on":[153,179],"each":[154,180],"optimality":[157],"within":[158],"few":[160],"seconds.":[161],"attains":[166],"high-quality":[167],"solutions":[168],"for":[169],"50":[172],"116":[177],"machine.":[181]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}