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

Hybrid approach for a single -batch -processing machine scheduling problem with a just -in -time objective and consideration of non-identical due dates of jobs

Zhang, Hongbin; Wu, Feng; Yang, Zhen*西安交通大学; 香港城市大学
COMPUTERS & OPERATIONS RESEARCH2021-4DOI: 10.1016/j.cor.2020.105194
7被引5阅读
引用收藏
分享

摘要

In this paper, we study a generalized single-batch-processing machine (SBPM) scheduling problem. Given a set of jobs that differ in terms of size, processing time and due date, the generalized SBPM problem aims to cluster the jobs into batches and process each batch one at a time on a capacitated batch-processing machine such that the total earliness and tardiness of jobs, a just-in-time objective, is minimized. We investigate the intrinsic properties of the optimal solutions of the problem, based on which an effective span-limited tree search (SLTS) heuristic is developed to find the near-optimal solutions to a restricted SBPM problem with a specified processing sequence of jobs. Varying the sequence, we embed the SLTS approach into a self-adapted genetic algorithm to further explore the solution space of the original prob-lem. A hybrid span-limited tree search and genetic algorithm approach is proposed. The results of exten-sive numerical experiments on various random instances with a common due date and non-identical due dates of jobs demonstrate the effectiveness and efficiency of the proposed approaches in obtaining high-quality near-optimal solutions. CO 2020 Elsevier Ltd.

学科与关键词

关键词
Batch processingSchedulingJust-in-timeHybrid approachNon-identical due dates
相关
加载中…
  • Just-in-time single-batch-processing machine scheduling
    Zhang, Hongbin*; Yang, Yu; Wu, FengCOMPUTERS & OPERATIONS RESEARCH, 2022, 140: 105675.被引 5
  • Scheduling a set of jobs with convex piecewise linear cost functions on a single-batch-processing machine
    Zhang, Hongbin; Yang, Yu; Wu, Feng*OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2024, 122: 102958.被引 1
  • Just-in-time scheduling problem with affine idleness cost
    Tan, Zhen*; Fu, GuanqiEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 313(3): 954-976.被引 1
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & OPERATIONS RESEARCH
发表日期
2021-04
卷期
第 128 卷
页码
105194
DOI
10.1016/j.cor.2020.105194
语言
ENGLISH
期刊等级
2区
成果收录
SCIE
资助标注
National Key R&D Program of China [2018YFB1703001, 2019YFB1703800]; National Natural Science Foundation of China [71971167, 71871177, 71471144]; State Key Laboratory for Manufacturing Systems Engineering Foundation of China [sklms 2020015]

作者

  • Z

    Zhang, Hongbin (第一作者)

    city univ hong kong · xi an jiao tong univ

  • W

    Wu, Feng

    xi an jiao tong univ

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

    Yang, Zhen (通讯)

    xi an jiao tong univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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