{"id":"https://openalex.org/W4415974713","doi":"https://doi.org/10.1016/j.procs.2025.09.210","title":"Heuristics for the flexible job shop scheduling problem with a single active workplace on a machine in which different workplaces are available","display_name":"Heuristics for the flexible job shop scheduling problem with a single active workplace on a machine in which different workplaces are available","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415974713","doi":"https://doi.org/10.1016/j.procs.2025.09.210"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.09.210","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.210","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.09.210","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043617863","display_name":"Kateryna Czerniachowska","orcid":"https://orcid.org/0000-0002-1808-6020"},"institutions":[{"id":"https://openalex.org/I305801656","display_name":"Wroclaw University of Economics and Business","ror":"https://ror.org/013sm1c65","country_code":"PL","type":"education","lineage":["https://openalex.org/I305801656"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Kateryna Czerniachowska","raw_affiliation_strings":["Wroclaw University of Economics and Business, Komandorska 118/120, 53-345 Wroclaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wroclaw University of Economics and Business, Komandorska 118/120, 53-345 Wroclaw, Poland","institution_ids":["https://openalex.org/I305801656"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043617863"],"corresponding_institution_ids":["https://openalex.org/I305801656"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.51641728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"270","issue":null,"first_page":"900","last_page":"909"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9409999847412109,"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.9409999847412109,"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/T12176","display_name":"Optimization and Packing Problems","score":0.010900000110268593,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.009800000116229057,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7943999767303467},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7197999954223633},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6360999941825867},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6114000082015991},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.5613999962806702},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.49230000376701355},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4424000084400177},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3847000002861023}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8399999737739563},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7943999767303467},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7197999954223633},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6360999941825867},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6114000082015991},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.5613999962806702},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49230000376701355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4544000029563904},{"id":"https://openalex.org/C13736549","wikidata":"https://www.wikidata.org/wiki/Q4489420","display_name":"Industrial engineering","level":1,"score":0.4440999925136566},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4424000084400177},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.41530001163482666},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3847000002861023},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3783999979496002},{"id":"https://openalex.org/C2777909354","wikidata":"https://www.wikidata.org/wiki/Q1386523","display_name":"Production planning","level":3,"score":0.37529999017715454},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.37070000171661377},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.34290000796318054},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C35799125","wikidata":"https://www.wikidata.org/wiki/Q7095711","display_name":"Open-shop scheduling","level":5,"score":0.32179999351501465},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.29760000109672546},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.27300000190734863},{"id":"https://openalex.org/C112866106","wikidata":"https://www.wikidata.org/wiki/Q267053","display_name":"Lottery scheduling","level":5,"score":0.2556999921798706},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.2540999948978424},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.09.210","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.210","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.09.210","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.210","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1549560875","https://openalex.org/W1588382077","https://openalex.org/W2032133760","https://openalex.org/W2046437335","https://openalex.org/W2054357626","https://openalex.org/W2070389897","https://openalex.org/W2077266984","https://openalex.org/W2116975258","https://openalex.org/W2126074884","https://openalex.org/W2157846217","https://openalex.org/W2512647882","https://openalex.org/W2572733028","https://openalex.org/W2752587565","https://openalex.org/W3128992509","https://openalex.org/W4212846574","https://openalex.org/W4310138322","https://openalex.org/W4379385025","https://openalex.org/W4405467940"],"related_works":[],"abstract_inverted_index":{"In":[0,56],"this":[1],"research,":[2],"we":[3],"look":[4],"into":[5,115],"the":[6,17,33,46,60,69,74,85,91,107,116],"world":[7],"of":[8,27,62,88,109],"heuristic":[9,67,102],"approaches":[10,103],"for":[11,40],"production":[12,110],"scheduling.":[13],"We":[14,36],"focus":[15],"on":[16],"flexible":[18],"job":[19,51],"shop":[20],"scheduling":[21,41,111],"problem":[22],"involving":[23],"multi-workplace":[24],"machines":[25],"capable":[26],"serving":[28],"only":[29],"one":[30],"workplace":[31],"at":[32],"same":[34],"time.":[35],"devised":[37],"two":[38],"heuristics":[39],"operations":[42,63,83],"in":[43,84,99],"scenarios":[44],"where":[45],"task":[47],"order":[48],"within":[49],"a":[50],"is":[52,79,93,104],"specified":[53],"and":[54,112],"unspecified.":[55],"both":[57],"modelled":[58],"scenarios,":[59],"sequence":[61],"was":[64],"predetermined.":[65],"A":[66],"uses":[68],"algorithm":[70],"to":[71,80,94,105],"carry":[72],"out":[73],"planning":[75],"process.":[76],"The":[77],"objective":[78],"process":[81],"all":[82],"shortest":[86],"amount":[87],"time,":[89],"i.e.,":[90],"makespan":[92],"be":[95],"minimized.":[96],"Our":[97],"aim":[98],"examining":[100],"these":[101],"push":[106],"boundaries":[108],"offer":[113],"insights":[114],"latest":[117],"methodologies.":[118]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-06T00:00:00"}