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

A new hybrid particle swarm optimization and parallel variable neighborhood search algorithm for flexible job shop scheduling with assembly process

Fattahi, Parviz; Rad, Naeeme Bagheri; Daneshamooz, Fatemeh; Ahmadi, Samad*
ASSEMBLY AUTOMATION2020-1-20DOI: 10.1108/AA-11-2018-0178
37被引21阅读
引用收藏
分享

摘要

Purpose The purpose of this paper is to present a mathematical model and a new hybrid algorithm for flexible job shop scheduling problem with assembly operations. In this problem, each product is produced by assembling a set of several different parts. At first, the parts are processed in a flexible job shop system, and then at the second stage, the parts are assembled and products are produced. Design/methodology/approach As the problem is non-deterministic polynomial-time-hard, a new hybrid particle swarm optimization and parallel variable neighborhood search (HPSOPVNS) algorithm is proposed. In this hybrid algorithm, particle swarm optimization (PSO) algorithm is used for global exploration of search space and parallel variable neighborhood search (PVNS) algorithm for local search at vicinity of solutions obtained in each iteration. For parameter tuning of the metaheuristic algorithms, Taguchi approach is used. Also, a statistical test is proposed to compare the ability of metaheuristics at finding the best solution in the medium and large sizes. Findings Numerical experiments are used to evaluate and validate the performance and effectiveness of HPSOPVNS algorithm with hybrid particle swarm optimization with a variable neighborhood search (HPSOVNS) algorithm, PSO algorithm and hybrid genetic algorithm and Tabu search (HGATS). The computational results show that the HPSOPVNS algorithm achieves better performance than competing algorithms. Originality/value This paper proposed a mathematical model and a new hybrid algorithm for flexible job shop scheduling problem with assembly operations.

学科与关键词

关键词
SchedulingFlexible job shopAssemblyParticle swarm optimization (PSO)Parallel variable neighborhood search (PVNS)Flexible manufacturingAssembly sequence planning
相关
加载中…
  • Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem
    Xu, Yuanxing; Zhang, Mengjian; Yang, Ming; Wang, Deguang*JOURNAL OF MANUFACTURING SYSTEMS, 2024, 73: 334-348.被引 9
  • MULTI-OBJECTIVE OPTIMIZATION OF INTEGRATED LOT-SIZING AND SCHEDULING PROBLEM IN FLEXIBLE JOB SHOPS
    Rohaninejad, Mohammad*; Sahraeian, Rashed; Nouri, Behdin VahediRAIRO-OPERATIONS RESEARCH, 2016, 50(3): 587-609.被引 16
  • Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan
    Zhang, Guanghui; Xing, Keyi*; Cao, FengInternational Journal of Production Research, 2018, 56(9): 3226-3244.被引 54
查看全部 →

发表信息

论文状态
公开发表
期刊
ASSEMBLY AUTOMATION
发表日期
2020-01-20
DOI
10.1108/AA-11-2018-0178
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
4区
成果收录
SCIE

作者

  • F

    Fattahi, Parviz (第一作者)

  • R

    Rad, Naeeme Bagheri

查看全部 4 位作者收起作者
  • D

    Daneshamooz, Fatemeh

  • A

    Ahmadi, Samad (通讯)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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