{"id":"https://openalex.org/W4294975933","doi":"https://doi.org/10.1109/mmar55195.2022.9874345","title":"Development of a decision model for solving the task scheduling of multiple Sequential Batch Reactors","display_name":"Development of a decision model for solving the task scheduling of multiple Sequential Batch Reactors","publication_year":2022,"publication_date":"2022-08-22","ids":{"openalex":"https://openalex.org/W4294975933","doi":"https://doi.org/10.1109/mmar55195.2022.9874345"},"language":"en","primary_location":{"id":"doi:10.1109/mmar55195.2022.9874345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar55195.2022.9874345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)","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/A5069131900","display_name":"Tomasz Ujazdowski","orcid":"https://orcid.org/0000-0001-6679-2985"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tomasz Ujazdowski","raw_affiliation_strings":["Digital Technologies Center, Gdańsk Tech,Faculty of Electrical and Control Engineering,Gdańsk,Poland,80-233"],"affiliations":[{"raw_affiliation_string":"Digital Technologies Center, Gdańsk Tech,Faculty of Electrical and Control Engineering,Gdańsk,Poland,80-233","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090519297","display_name":"Robert Piotrowski","orcid":"https://orcid.org/0000-0002-0499-3463"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Piotrowski","raw_affiliation_strings":["Digital Technologies Center, Gdańsk Tech,Faculty of Electrical and Control Engineering,Gdańsk,Poland,80-233"],"affiliations":[{"raw_affiliation_string":"Digital Technologies Center, Gdańsk Tech,Faculty of Electrical and Control Engineering,Gdańsk,Poland,80-233","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069131900"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1334,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52659632,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"59","last_page":"63"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9962000250816345,"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.9962000250816345,"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/T11053","display_name":"Process Optimization and Integration","score":0.9782000184059143,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T14470","display_name":"Advanced Data Processing Techniques","score":0.9681000113487244,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.70697021484375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6897116899490356},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6080436706542969},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5820721387863159},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5328569412231445},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4833950102329254},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.47534701228141785},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.4311865270137787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17376196384429932},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09879210591316223}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.70697021484375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6897116899490356},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6080436706542969},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5820721387863159},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5328569412231445},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4833950102329254},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.47534701228141785},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.4311865270137787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17376196384429932},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09879210591316223},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mmar55195.2022.9874345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar55195.2022.9874345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G159420259","display_name":null,"funder_award_id":"DEC-43/2021/IDUB/I.3.3","funder_id":"https://openalex.org/F4320323690","funder_display_name":"Politechnika Gda\u0144ska"}],"funders":[{"id":"https://openalex.org/F4320323690","display_name":"Politechnika Gda\u0144ska","ror":"https://ror.org/006x4sc24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1923387","https://openalex.org/W1999534989","https://openalex.org/W2028781468","https://openalex.org/W2034282101","https://openalex.org/W2089269509","https://openalex.org/W2898006946","https://openalex.org/W4226468349","https://openalex.org/W4232294174","https://openalex.org/W4234843792"],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2949165180","https://openalex.org/W4399221052","https://openalex.org/W2384952691","https://openalex.org/W2538210412"],"abstract_inverted_index":{"This":[0],"paper":[1,16],"considers":[2],"the":[3,7,23,42,71,78,89,93,99,106],"problem":[4,73],"of":[5,10,35,41,70,91,101,105],"scheduling":[6,46,55],"work":[8],"cycles":[9],"multiple":[11],"Sequential":[12,107],"Batch":[13,108],"Reactors.":[14,109],"The":[15,39,68],"proposes":[17],"a":[18],"decision":[19],"model":[20,43],"based":[21],"on":[22],"Flow-Shop":[24],"Scheduling":[25],"Problem.":[26],"Three":[27],"tank":[28],"sizes":[29],"and":[30,61,98],"tasks":[31],"with":[32],"variable":[33],"number":[34],"phases":[36],"were":[37],"assumed.":[38],"application":[40],"for":[44,82],"task":[45],"has":[47],"been":[48],"tested":[49],"using":[50,77],"an":[51],"optimisation":[52],"algorithm.":[53],"Task":[54],"problems":[56,60],"belong":[57],"to":[58],"NP-hard":[59],"are":[62],"often":[63],"solved":[64],"by":[65,76],"non-deterministic":[66],"algorithms.":[67],"solution":[69],"presented":[72],"was":[74],"realised":[75],"differential":[79],"evolution":[80],"algorithm":[81],"three":[83],"different":[84],"objective":[85],"functions.":[86],"Assuming":[87],"both":[88],"criterion":[90,100],"minimising":[92],"maximum":[94],"execution":[95],"time":[96,104],"(makespan)":[97],"even":[102],"operating":[103]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}