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

Solving the flexible job shop scheduling problem with sequence-dependent setup times

Shen, Liji*; Dauzere-Peres, Stephane; Neufeld, Janis S.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH2018-3-1DOI: 10.1016/j.ejor.2017.08.021
151被引12阅读
引用收藏
分享

摘要

This paper addresses the flexible job shop scheduling problem with sequence-dependent setup times and where the objective is to minimize the makespan. We first present a mathematical model which can solve small instances to optimality, and also serves as a problem representation. After studying structural properties of the problem using a disjunctive graph model, we develop a tabu search algorithm with specific neighborhood functions and a diversification structure. Extensive experiments are conducted on benchmark instances. Test results first show that our algorithm outperforms most existing approaches for the classical flexible job shop scheduling problem. Additional experiments also confirm the significant improvement achieved by integrating the propositions introduced in this study.

学科与关键词

关键词
SchedulingFlexible job shopTabu searchSequence-dependent setup times
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
发表日期
2018-03-01
卷期
第 265 卷, 第 2 期
页码
503-516
DOI
10.1016/j.ejor.2017.08.021
语言
ENGLISH
期刊等级
Q1
成果收录
SCIE

作者

  • S

    Shen, Liji (通讯) (第一作者)

  • D

    Dauzere-Peres, Stephane

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

    Neufeld, Janis S.

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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