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

A meta-heuristic to solve the just-in-time job-shop scheduling problem

Ahmadian, Mohammad Mahdi; Salehipour, Amir*; Cheng, T. C. E.hong kong polytech univ
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH2021-1-1DOI: 10.1016/j.ejor.2020.04.017
67被引1阅读
引用收藏
分享

摘要

Just-in-time job-shop scheduling (JIT-JSS) is a variant of the job-shop scheduling problem, in which each operation has a distinct due-date and any deviation of the operation completion time from its due-date incurs an earliness or tardiness penalty. We develop a variable neighbourhood search (VNS) algorithm to solve JIT-JSS. The algorithm operates by decomposing JIT-JSS into smaller problems, obtaining optimal or near-optimal sequences of performing the operations for those smaller problems, and generating a schedule, i.e., determining the completion time of the operations, for JIT-JSS. The algorithm uses several neighbourhood structures, including the new relaxation neighbourhoods developed in this study, to obtain a quality sequence. The relaxation neighbourhoods partially destruct (relax) the sequence and then re-construct (sequence) certain operations. Differing from the classical neighbourhoods, in which manipulations are performed either randomly or myopically, the moves in the new neighbourhoods are made with reference to other operations, so their impacts on the whole sequence are well considered. By solving a set of 72 benchmark instances, ranging from 10 to 20 jobs and 20 to 200 operations, and comparing the outcomes of the proposed algorithm with the state-of-the-art solution methods in the literature, we obtain new best solutions for nearly 57% of the instances, including new best solutions for 80% of the in-stances with 20 jobs. The computational results demonstrate the efficacy of the proposed VNS algorithm.

学科与关键词

关键词
SchedulingJust-in-timeWeighted earliness-tardinessHeuristicRelaxation neighbourhoodRelax-and-solve
相关
加载中…
  • The just-in-time job-shop scheduling problem with distinct due-dates for operations
    Ahmadian, Mohammad Mahdi; Salehipour, Amir*JOURNAL OF HEURISTICS, 2021, 27(1-2): 175-204.被引 9
  • An Enhanced Two-Level Metaheuristic Algorithm with Adaptive Hybrid Neighborhood Structures for the Job-Shop Scheduling Problem
    Pongchairerks, Pisut*COMPLEXITY, 2020, 2020: 3489209.被引 5
  • Minimizing the total weighted earliness and tardiness for a sequence of operations in job shops
    Girish, Baby Sivanandan*; Habibullah; Dileeplal, JessammaRAIRO-OPERATIONS RESEARCH, 2022, 56(4): 2621-2649.被引 2
查看全部 →

发表信息

论文状态
公开发表
期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
发表日期
2021-01-01
卷期
第 288 卷, 第 1 期
页码
14-29
DOI
10.1016/j.ejor.2020.04.017
语言
ENGLISH
期刊收录
NSL
期刊等级
1区
成果收录
SCIE
资助标注
UTS International Research Scholarship (IRS); UTS Faculty of Science Scholarship; Australian Research Council - Australian Government [DE170100234]; The Hong Kong Polytechnic University under the Fung Yiu King -Wing Hang Bank Endowed Professorship in Business Administration; Australian Research Council [DE170100234] Funding Source: Australian Research Council

作者

  • A

    Ahmadian, Mohammad Mahdi (第一作者)

  • S

    Salehipour, Amir (通讯)

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

    Cheng, T. C. E.

    hong kong polytech univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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