ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem

Ferone, Daniele*; Hatami, Sara; Gonzalez-Neira, Eliana M.; Juan, Angel A.; Festa, Paola
International Transactions in Operational Research2020-5DOI: 10.1111/itor.12719
50被引3阅读
引用收藏
分享

摘要

Modern production systems require multiple manufacturing centers-usually distributed among different locations-where the outcomes of each center need to be assembled to generate the final product. This paper discusses the distributed assembly permutation flow-shop scheduling problem, which consists of two stages: the first stage is composed of several production factories, each of them with a flow-shop configuration; in the second stage, the outcomes of each flow-shop are assembled into a final product. The goal here is to minimize the makespan of the entire manufacturing process. With this objective in mind, we present an efficient and parameter-less algorithm that makes use of a biased-randomized iterated local search metaheuristic. The efficiency of the proposed method is evaluated through the analysis of an extensive set of computational experiments. The results show that our algorithm offers excellent performance when compared with other state-of-the-art approaches, obtaining several new best solutions.

学科与关键词

关键词
permutation flow-shop schedulingmetaheuristicassembly systemdistributed manufacturing systemiterated local searchbiased randomization
相关
加载中…
  • A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times
    Maria Gonzalez-Neira, Eliana; Ferone, Daniele; Hatami, Sara; Juan, Angel A.SIMULATION MODELLING PRACTICE AND THEORY, 2017, 79: 23-36.被引 102
  • A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
    Fernandez-Viagas, Victor*; Framinan, Jose M.International Journal of Production Research, 2015, 53(4): 1111-1123.被引 172
  • The distributed permutation flow shop to minimise the total flowtime
    Fernandez-Viagas, Victor*; Perez-Gonzalez, Paz; Framinan, Jose M.COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 118: 464-477.被引 133
查看全部 →

发表信息

论文状态
公开发表
期刊
International Transactions in Operational Research
发表日期
2020-05
卷期
第 27 卷, 第 3 期
页码
1368-1391
DOI
10.1111/itor.12719
语言
ENGLISH
期刊收录
NSL.SSCI.SCIE
期刊等级
3区
成果收录
SCIE
资助标注
Erasmus programme [2018-1-ES01-KA103049767]

作者

  • F

    Ferone, Daniele (通讯) (第一作者)

  • H

    Hatami, Sara

查看全部 5 位作者收起作者
  • G

    Gonzalez-Neira, Eliana M.

  • J

    Juan, Angel A.

  • F

    Festa, Paola

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417