{"id":"https://openalex.org/W1984335678","doi":"https://doi.org/10.1057/palgrave.jors.2601682","title":"Flowshop scheduling problem to minimize total completion time with random and bounded processing times","display_name":"Flowshop scheduling problem to minimize total completion time with random and bounded processing times","publication_year":2004,"publication_date":"2004-02-13","ids":{"openalex":"https://openalex.org/W1984335678","doi":"https://doi.org/10.1057/palgrave.jors.2601682","mag":"1984335678"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2601682","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601682","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-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/A5062123009","display_name":"Yuri N. Sotskov","orcid":"https://orcid.org/0000-0002-9971-6169"},"institutions":[{"id":"https://openalex.org/I4210105192","display_name":"United Institute of Informatics Problems","ror":"https://ror.org/01ccbsb07","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210105192","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Y N Sotskov","raw_affiliation_strings":["United Institute of Informatics Problems Minsk Belarus","United Institute of Informatics Problems, Minsk, Belarus"],"affiliations":[{"raw_affiliation_string":"United Institute of Informatics Problems Minsk Belarus","institution_ids":["https://openalex.org/I4210105192"]},{"raw_affiliation_string":"United Institute of Informatics Problems, Minsk, Belarus","institution_ids":["https://openalex.org/I4210105192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040251307","display_name":"Ali Allahverdi","orcid":"https://orcid.org/0000-0002-8988-9226"},"institutions":[{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]}],"countries":["KW"],"is_corresponding":true,"raw_author_name":"A Allahverdi","raw_affiliation_strings":["Kuwait University Safat Kuwait"],"affiliations":[{"raw_affiliation_string":"Kuwait University Safat Kuwait","institution_ids":["https://openalex.org/I36721946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103407458","display_name":"T-C Lai","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"T-C Lai","raw_affiliation_strings":["National Taiwan University Tapei Taiwan"],"affiliations":[{"raw_affiliation_string":"National Taiwan University Tapei Taiwan","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040251307"],"corresponding_institution_ids":["https://openalex.org/I36721946"],"apc_list":null,"apc_paid":null,"fwci":1.6782,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.84327122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"55","issue":"3","first_page":"277","last_page":"286"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9851999878883362,"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/T12288","display_name":"Optimization and Search Problems","score":0.9675999879837036,"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/scheduling","display_name":"Scheduling (production processes)","score":0.7385511994361877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6352137923240662},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5364620685577393},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5117995142936707},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4595045745372772},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.43948468565940857},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23888587951660156},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.2140929400920868}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7385511994361877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6352137923240662},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5364620685577393},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5117995142936707},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4595045745372772},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.43948468565940857},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23888587951660156},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2140929400920868},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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":2,"locations":[{"id":"doi:10.1057/palgrave.jors.2601682","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601682","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:55:y:2004:i:3:d:10.1057_palgrave.jors.2601682","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2601682","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W201573687","https://openalex.org/W568095434","https://openalex.org/W613241997","https://openalex.org/W964861289","https://openalex.org/W1966592923","https://openalex.org/W1967955864","https://openalex.org/W1975320395","https://openalex.org/W1981918980","https://openalex.org/W1996767184","https://openalex.org/W2008958187","https://openalex.org/W2011987617","https://openalex.org/W2021332592","https://openalex.org/W2022113174","https://openalex.org/W2037856370","https://openalex.org/W2049258233","https://openalex.org/W2059796104","https://openalex.org/W2063552989","https://openalex.org/W2066740230","https://openalex.org/W2068615854","https://openalex.org/W2071502501","https://openalex.org/W2076134632","https://openalex.org/W2085822348","https://openalex.org/W2090388220","https://openalex.org/W2091541858","https://openalex.org/W2100173285","https://openalex.org/W2102186516","https://openalex.org/W2122967269","https://openalex.org/W2145420637","https://openalex.org/W2148039735","https://openalex.org/W2576116471","https://openalex.org/W2808376720"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W3204654320","https://openalex.org/W2025955409","https://openalex.org/W1577301438","https://openalex.org/W1986410062","https://openalex.org/W4231062255"],"abstract_inverted_index":{"Abstract":[0],"The":[1,32,116],"flowshop":[2,122],"scheduling":[3],"problems":[4],"with":[5,15,124],"n":[6],"jobs":[7,17,25,103,126],"processed":[8,18],"on":[9,19],"two":[10,16,102,112,125],"or":[11],"three":[12,114],"machines,":[13],"and":[14,28,41,45,76,113,127],"k":[20,128],"machines":[21],"are":[22,39,51],"addressed":[23],"where":[24],"have":[26],"random":[27,36],"bounded":[29],"processing":[30,37,49,74],"times.":[31],"probability":[33],"distributions":[34],"of":[35,48,72,80,101,111],"times":[38,50],"unknown,":[40],"only":[42],"the":[43,73,92,109],"lower":[44],"upper":[46],"bounds":[47],"given":[52,93],"before":[53],"scheduling.":[54],"In":[55],"such":[56],"cases,":[57],"there":[58],"may":[59],"not":[60],"exist":[61],"a":[62,78],"unique":[63],"schedule":[64],"that":[65],"remains":[66],"optimal":[67],"for":[68,91,108,121],"all":[69,88],"feasible":[70],"realizations":[71],"times,":[75],"therefore,":[77],"set":[79],"schedules":[81,90],"has":[82],"to":[83],"be":[84],"considered":[85],"which":[86],"dominates":[87],"other":[89],"criterion.":[94],"We":[95],"obtain":[96],"sufficient":[97],"conditions":[98],"when":[99],"transposition":[100],"minimizes":[104],"total":[105],"completion":[106],"time":[107],"cases":[110],"machines.":[115,129],"geometrical":[117],"approach":[118],"is":[119],"utilized":[120],"problem":[123]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}