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

Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time

Xiong, Fuli; Xing, Keyi*; Wang, Feng西安交通大学
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH2015-1-16DOI: 10.1016/j.ejor.2014.07.004
32被引2阅读
引用收藏
分享

摘要

This study considers a hybrid assembly-differentiation flowshop scheduling problem (HADFSP), in which there are three production stages, including components manufacturing, assembly, and differentiation. All the components of a job are processed on different machines at the first stage. Subsequently, they are assembled together on a common single machine at the second stage. At the third stage, each job of a particular type is processed on a dedicated machine. The objective is to find a job schedule to minimize total flow time (TFT). At first, a mixed integer programming (MIP) model is formulated and then some properties of the optimal solution are presented. Since the NP-hardness of the problem, two fast heuristics (SPT-based heuristic and NEH-based heuristic) and three hybrid meta-heuristics (HGA-VNS, HDDE-VNS and HEDA-VNS) are developed for solving medium- and large-size problems. In order to evaluate the performances of the proposed algorithms, a lower bound for the HADFSP with TFT criteria (HAD-FSP-TFT) is established. The MIP model and the proposed algorithms are compared on randomly generated problems. Computational results show the effectiveness of the MIP model and the proposed algorithms. The computational analysis indicates that, in average, the HDDE-VNS performs better and more robustly than the other two meta-heuristics, whereas the NEH heuristic consume little time and could reach reasonable solutions.

学科与关键词

关键词
SchedulingHybrid assembly-differentiation flowshopHybrid meta-heuristicsTotal flow time
相关
加载中…
  • 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
  • Minimizing the total completion time in a distributed two stage assembly system with setup times
    Xiong, Fuli; Xing, Keyi*; Wang, Feng; Lei, Hang; Han, LibinCOMPUTERS & OPERATIONS RESEARCH, 2014, 47: 92-105.被引 62
  • Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
    Zobolas, G. I.*; Tarantilis, C. D.; Ioannou, G.COMPUTERS & OPERATIONS RESEARCH, 2009, 36(4): 1249-1267.被引 117
查看全部 →

发表信息

论文状态
公开发表
期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
发表日期
2015-01-16
卷期
第 240 卷, 第 2 期
页码
338-354
DOI
10.1016/j.ejor.2014.07.004
语言
ENGLISH
期刊收录
SCIE
期刊等级
Q1
成果收录
SCIE
资助标注
National Natural Science Foundation of China [50975224]; Scientific Research Foundation for Talents (Xi'an University of Architecture and Technology) [RC1408]; Basic Research Foundation (Xi'an University of Architecture and Technology) [JC1414]; China Postdoctoral Science Foundation Funded Project [2012M521783]; Open Research Foundation from State Key Laboratory for Manufacturing Systems Engineering (Xi'an Jiaotong University) [SKLMS2012008]

作者

  • X

    Xiong, Fuli (第一作者)

    xian univ architecture & technol · xi an jiao tong univ

  • X

    Xing, Keyi (通讯)

    xi an jiao tong univ

查看全部 3 位作者收起作者
  • W

    Wang, Feng

    xi an jiao tong univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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