{"id":"https://openalex.org/W6888862668","doi":"https://doi.org/10.23773/2023_6","title":"Relaxation and self-supervised machine learning for the hybrid flow shop assignment problem","display_name":"Relaxation and self-supervised machine learning for the hybrid flow shop assignment problem","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W6888862668","doi":"https://doi.org/10.23773/2023_6"},"language":"en","primary_location":{"id":"pmh:oai:econstor.eu:10419/297210","is_oa":true,"landing_page_url":"https://hdl.handle.net/10419/297210","pdf_url":"https://www.econstor.eu/bitstream/10419/297210/1/1886049653.pdf","source":{"id":"https://openalex.org/S4306401696","display_name":"Econstor (Econstor)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:article"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.econstor.eu/bitstream/10419/297210/1/1886049653.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tonnius, Annika","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tonnius, Annika","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Martin, Robert J.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin, Robert J.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1765,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62324758,"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8671000003814697,"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.8671000003814697,"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.02710000053048134,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.01979999989271164,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6068000197410583},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5508000254631042},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5479999780654907},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4927999973297119},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.4242999851703644},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4092999994754791},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3772999942302704},{"id":"https://openalex.org/keywords/supervised-learning","display_name":"Supervised learning","score":0.34599998593330383}],"concepts":[{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6068000197410583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5856999754905701},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5508000254631042},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5479999780654907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.52920001745224},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5214999914169312},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4927999973297119},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4092999994754791},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4090000092983246},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3772999942302704},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.34599998593330383},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3434999883174896},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.34150001406669617},{"id":"https://openalex.org/C115903097","wikidata":"https://www.wikidata.org/wiki/Q7094097","display_name":"Online machine learning","level":3,"score":0.32670000195503235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3244999945163727},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.3228999972343445},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3158999979496002},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.30820000171661377},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C10431821","wikidata":"https://www.wikidata.org/wiki/Q6510174","display_name":"Learning effect","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:econstor.eu:10419/297210","is_oa":true,"landing_page_url":"https://hdl.handle.net/10419/297210","pdf_url":"https://www.econstor.eu/bitstream/10419/297210/1/1886049653.pdf","source":{"id":"https://openalex.org/S4306401696","display_name":"Econstor (Econstor)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:article"}],"best_oa_location":{"id":"pmh:oai:econstor.eu:10419/297210","is_oa":true,"landing_page_url":"https://hdl.handle.net/10419/297210","pdf_url":"https://www.econstor.eu/bitstream/10419/297210/1/1886049653.pdf","source":{"id":"https://openalex.org/S4306401696","display_name":"Econstor (Econstor)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:article"},"sustainable_development_goals":[{"score":0.6029312014579773,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6888862668.pdf","grobid_xml":"https://content.openalex.org/works/W6888862668.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"approximation":[3,88],"method":[4,38],"for":[5,39,63,103],"the":[6,26,53,78,93,107],"hybrid":[7,68],"flow":[8,69],"shop":[9,70],"scheduling":[10],"problem":[11],"based":[12],"on":[13],"relaxation":[14,24],"and":[15],"machine":[16],"learning":[17,37,99],"techniques.":[18],"Our":[19],"model":[20],"combines":[21],"a":[22,30,35],"suitable":[23],"of":[25,55,74,96,110],"objective":[27],"function":[28],"to":[29],"continuous":[31],"solution":[32],"space":[33],"with":[34,86],"self-supervised":[36],"neural":[40],"networks,":[41],"which":[42,58,90],"does":[43],"not":[44,61],"require":[45],"any":[46],"labeled":[47],"training":[48],"data.":[49],"Thereby,":[50],"we":[51],"avoid":[52],"pre-computation":[54],"exact":[56],"solutions,":[57],"is":[59,100],"generally":[60],"feasible":[62],"NP-hard":[64,112],"problems":[65],"such":[66],"as":[67],"scheduling.":[71],"In":[72],"terms":[73],"computational":[75],"effort":[76],"during":[77],"decision":[79],"process,":[80],"our":[81],"approach":[82],"outperforms":[83],"other":[84],"methods":[85],"similar":[87],"accuracy,":[89],"suggests":[91],"that":[92],"considered":[94],"technique":[95],"self-":[97],"supervised":[98],"well":[101],"suited":[102],"high-performance":[104],"applications":[105],"involving":[106],"approximate":[108],"optimization":[109],"discrete":[111],"problems.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}