{"id":"https://openalex.org/W2586313781","doi":"https://doi.org/10.1080/00207543.2017.1285077","title":"New scheduling algorithms and digital tool for dynamic permutation flowshop with newly arrived order","display_name":"New scheduling algorithms and digital tool for dynamic permutation flowshop with newly arrived order","publication_year":2017,"publication_date":"2017-02-06","ids":{"openalex":"https://openalex.org/W2586313781","doi":"https://doi.org/10.1080/00207543.2017.1285077","mag":"2586313781"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2017.1285077","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2017.1285077","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pureadmin.qub.ac.uk/ws/files/123501939/New_heuristic_algorithm_for_permutation_flowshop_with_new_order_arrival_preprint.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101519816","display_name":"Weibo Liu","orcid":"https://orcid.org/0000-0002-8124-7413"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Weibo Liu","raw_affiliation_strings":["School of Mechanical and Aerospace Engineering, Queen\u2019s University Belfast, Belfast, UK","School of Mechanical and Aerospace Engineering, Queen's University Belfast, Belfast, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Queen\u2019s University Belfast, Belfast, UK","institution_ids":["https://openalex.org/I126231945"]},{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Queen's University Belfast, Belfast, UK","institution_ids":["https://openalex.org/I126231945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007118645","display_name":"Yan Jin","orcid":"https://orcid.org/0000-0003-2247-6854"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Yan Jin","raw_affiliation_strings":["School of Mechanical and Aerospace Engineering, Queen\u2019s University Belfast, Belfast, UK","School of Mechanical and Aerospace Engineering, Queen's University Belfast, Belfast, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Queen\u2019s University Belfast, Belfast, UK","institution_ids":["https://openalex.org/I126231945"]},{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Queen's University Belfast, Belfast, UK","institution_ids":["https://openalex.org/I126231945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074117874","display_name":"Mark Price","orcid":"https://orcid.org/0000-0002-4551-4457"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark Price","raw_affiliation_strings":["School of Mechanical and Aerospace Engineering, Queen\u2019s University Belfast, Belfast, UK","School of Mechanical and Aerospace Engineering, Queen's University Belfast, Belfast, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Queen\u2019s University Belfast, Belfast, UK","institution_ids":["https://openalex.org/I126231945"]},{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Queen's University Belfast, Belfast, UK","institution_ids":["https://openalex.org/I126231945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007118645"],"corresponding_institution_ids":["https://openalex.org/I126231945"],"apc_list":null,"apc_paid":null,"fwci":2.0779,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.87846465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"55","issue":"11","first_page":"3234","last_page":"3248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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.9972000122070312,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9941999912261963,"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/heuristics","display_name":"Heuristics","score":0.8164170980453491},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6850774884223938},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6440165638923645},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5852386355400085},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5502699017524719},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.534168541431427},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5047158002853394},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.49897265434265137},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4771127998828888},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.42079901695251465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37345489859580994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16949084401130676}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8164170980453491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6850774884223938},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6440165638923645},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5852386355400085},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5502699017524719},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.534168541431427},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5047158002853394},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.49897265434265137},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4771127998828888},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.42079901695251465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37345489859580994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16949084401130676},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1080/00207543.2017.1285077","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2017.1285077","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:openaire/ec5f71ce-11e0-4d2c-933f-2eef33b4d0d3","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/ec5f71ce-11e0-4d2c-933f-2eef33b4d0d3","pdf_url":"https://pureadmin.qub.ac.uk/ws/files/123501939/New_heuristic_algorithm_for_permutation_flowshop_with_new_order_arrival_preprint.pdf","source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liu, W, Jin, Y & Price, M 2017, 'New Scheduling Algorithms and Digital Tool for Dynamic Permutation Flowshop with Newly Arrived Order', International Journal of Production Research, vol. 55, no. 11, pp. 3234-3248. https://doi.org/10.1080/00207543.2017.1285077","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:55:y:2017:i:11:p:3234-3248","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2017.1285077","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/ec5f71ce-11e0-4d2c-933f-2eef33b4d0d3","is_oa":true,"landing_page_url":"http://www.tandfonline.com/eprint/AHvw9d5PzMZewsSTkfCJ/full","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liu , W , Jin , Y & Price , M 2017 , ' New Scheduling Algorithms and Digital Tool for Dynamic Permutation Flowshop with Newly Arrived Order ' , International Journal of Production Research , vol. 55 , no. 11 , pp. 3234-3248 . https://doi.org/10.1080/00207543.2017.1285077","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.qub.ac.uk/portal:openaire/ec5f71ce-11e0-4d2c-933f-2eef33b4d0d3","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/ec5f71ce-11e0-4d2c-933f-2eef33b4d0d3","pdf_url":"https://pureadmin.qub.ac.uk/ws/files/123501939/New_heuristic_algorithm_for_permutation_flowshop_with_new_order_arrival_preprint.pdf","source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liu, W, Jin, Y & Price, M 2017, 'New Scheduling Algorithms and Digital Tool for Dynamic Permutation Flowshop with Newly Arrived Order', International Journal of Production Research, vol. 55, no. 11, pp. 3234-3248. https://doi.org/10.1080/00207543.2017.1285077","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320357","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62"},{"id":"https://openalex.org/F4320321832","display_name":"Queen's University","ror":"https://ror.org/02y72wh86"},{"id":"https://openalex.org/F4320322725","display_name":"China Scholarship Council","ror":"https://ror.org/04atp4p48"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2586313781.pdf","grobid_xml":"https://content.openalex.org/works/W2586313781.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W109241435","https://openalex.org/W654019736","https://openalex.org/W953276813","https://openalex.org/W1488422606","https://openalex.org/W1699741965","https://openalex.org/W1965349461","https://openalex.org/W1965868759","https://openalex.org/W1977132897","https://openalex.org/W1987346008","https://openalex.org/W1995117679","https://openalex.org/W1997032351","https://openalex.org/W2008180059","https://openalex.org/W2011447885","https://openalex.org/W2013822994","https://openalex.org/W2014158879","https://openalex.org/W2015178471","https://openalex.org/W2019918358","https://openalex.org/W2025389484","https://openalex.org/W2026944273","https://openalex.org/W2039550272","https://openalex.org/W2061170370","https://openalex.org/W2063345867","https://openalex.org/W2067840693","https://openalex.org/W2070005925","https://openalex.org/W2071320663","https://openalex.org/W2084486486","https://openalex.org/W2086738348","https://openalex.org/W2088298082","https://openalex.org/W2088865390","https://openalex.org/W2089520628","https://openalex.org/W2090069860","https://openalex.org/W2094286860","https://openalex.org/W2128285712","https://openalex.org/W2139996487","https://openalex.org/W2154429979","https://openalex.org/W2156391157","https://openalex.org/W2343110676","https://openalex.org/W4246113444","https://openalex.org/W4255355362"],"related_works":["https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W2012754152","https://openalex.org/W2949165180","https://openalex.org/W2838819579","https://openalex.org/W2152153864","https://openalex.org/W2384952691","https://openalex.org/W2538210412","https://openalex.org/W131757205"],"abstract_inverted_index":{"The":[0],"permutation":[1],"flowshop":[2],"scheduling":[3,40,76,97],"problem":[4],"has":[5],"been":[6],"widely":[7],"studied":[8],"under":[9],"static":[10],"environment":[11],"by":[12,102,169],"assuming":[13],"machines":[14],"and":[15,69,106,139,165],"jobs":[16,66],"are":[17,82,134],"available":[18],"at":[19,30],"the":[20,43,59,79,87,116,120,127,147,150],"time":[21,118],"of":[22,49,67,115,149,160,162],"zero.":[23],"However,":[24],"in":[25,39,74,110],"reality,":[26],"new":[27,55,70,128,132,141,151],"orders":[28,56,71],"arrive":[29],"production":[31],"systems":[32],"randomly,":[33],"which":[34],"leads":[35],"to":[36,42,85,112],"sheer":[37],"complexity":[38],"due":[41,123],"dynamic":[44],"changes":[45],"given":[46],"various":[47],"constraints":[48],"resources.":[50],"Previous":[51],"studies":[52],"simply":[53],"attach":[54],"directly":[57],"after":[58],"existing":[60,138],"schedule.":[61],"Recent":[62],"study":[63],"shows":[64],"mixing":[65,89],"old":[68,121],"could":[72],"result":[73],"better":[75],"solutions.":[77],"But":[78],"heuristic":[80],"algorithms":[81],"still":[83],"lacking":[84],"implement":[86],"job":[88],"policy.":[90],"To":[91],"address":[92],"this":[93],"problem,":[94],"a":[95],"novel":[96],"strategy":[98,105,108],"is":[99,156,167],"herein":[100],"proposed":[101],"integrating":[103],"match-up":[104],"real-time":[107],"(MR)":[109],"order":[111,122],"make":[113],"use":[114],"remaining":[117],"before":[119],"date.":[124],"Based":[125],"on":[126],"MR":[129],"strategy,":[130],"eleven":[131],"heuristics":[133],"introduced":[135],"with":[136],"ten":[137],"one":[140],"priority":[142],"rules.":[143],"Computational":[144],"results":[145],"illustrate":[146],"effectiveness":[148],"heuristics.":[152],"A":[153],"digital":[154],"tool":[155],"developed":[157],"for":[158],"ease":[159],"application":[161],"these":[163],"heuristics,":[164],"it":[166],"validated":[168],"case":[170],"studies.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}