{"id":"https://openalex.org/W2065891797","doi":"https://doi.org/10.1057/palgrave.jors.2602099","title":"A new algorithm for minimizing makespan, <i>C</i><sub>max</sub>, in blocking flow-shop problem through slowing down the operations","display_name":"A new algorithm for minimizing makespan, <i>C</i><sub>max</sub>, in blocking flow-shop problem through slowing down the operations","publication_year":2006,"publication_date":"2006-02-21","ids":{"openalex":"https://openalex.org/W2065891797","doi":"https://doi.org/10.1057/palgrave.jors.2602099","mag":"2065891797"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2602099","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2602099","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/A5040717848","display_name":"Isa Nakhai Kamal Abadi","orcid":null},"institutions":[{"id":"https://openalex.org/I3124704065","display_name":"University of Kurdistan","ror":"https://ror.org/04k89yk85","country_code":"IR","type":"education","lineage":["https://openalex.org/I3124704065"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"I N Kamal Abadi","raw_affiliation_strings":["University of Kurdistan Sanandaj Iran","University of Kurdistan Sanandaj, Iran"],"affiliations":[{"raw_affiliation_string":"University of Kurdistan Sanandaj Iran","institution_ids":["https://openalex.org/I3124704065"]},{"raw_affiliation_string":"University of Kurdistan Sanandaj, Iran","institution_ids":["https://openalex.org/I3124704065"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040717848"],"corresponding_institution_ids":["https://openalex.org/I3124704065"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17089409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"58","issue":"1","first_page":"134","last_page":"140"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9945999979972839,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8953613042831421},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.7244229316711426},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.6106849908828735},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5907155275344849},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5619126558303833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5324379205703735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5094159245491028},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4108507037162781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32543429732322693},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.10870817303657532},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.06442645192146301},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0626104474067688}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8953613042831421},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.7244229316711426},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.6106849908828735},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5907155275344849},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5619126558303833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5324379205703735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5094159245491028},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4108507037162781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32543429732322693},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.10870817303657532},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.06442645192146301},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0626104474067688}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/palgrave.jors.2602099","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2602099","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:58:y:2007:i:1:d:10.1057_palgrave.jors.2602099","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2602099","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W629225986","https://openalex.org/W1488422606","https://openalex.org/W1967348328","https://openalex.org/W2032314102","https://openalex.org/W2035133691","https://openalex.org/W2075322358","https://openalex.org/W2076176801","https://openalex.org/W2125613881","https://openalex.org/W2131446946","https://openalex.org/W2149301478","https://openalex.org/W2170926441","https://openalex.org/W4360972258"],"related_works":["https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W3155166764"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3,18,28,34,54,58],"new":[4,73],"algorithm":[5,74],"with":[6,48,64],"complexity":[7],"O(nm2)":[8],"is":[9,43,57,75],"presented,":[10],"which":[11],"finds":[12],"the":[13,25,40,46,79],"optimal":[14],"makespan,":[15,51],"Cmax,":[16,52],"for":[17,33,83],"blocking":[19],"flow-shop":[20,30],"problem":[21,47,63],"by":[22],"slowing":[23,41],"down":[24,42],"operations":[26],"of":[27,61],"no-wait":[29],"problem,":[31],"Fm\u2223no-wait\u2223Cmax,":[32],"given":[35],"sequence":[36],"where":[37],"restriction":[38],"on":[39],"committed.":[44],"However,":[45],"performance":[49,70],"measure":[50],"in":[53],"non-cyclic":[55],"environment,":[56],"special":[59],"case":[60],"cyclic":[62],"cycle":[65],"time,":[66],"Ct,":[67],"as":[68],"its":[69],"measure.":[71],"This":[72],"much":[76],"faster":[77],"than":[78],"previously":[80],"developed":[81],"algorithms":[82],"cyclical":[84],"scheduling":[85],"problems.":[86]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}