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

Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: A mathematical model and heuristic solutions

Homayouni, S. Mahdi*; Fontes, Dalila B. M. M.
International Transactions in Operational Research2025-1DOI: 10.1111/itor.13414
1被引4阅读
引用收藏
分享

摘要

This paper addresses a job shop scheduling problem with peak power constraints, in which jobs can be processed once or multiple times on either all or a subset of the machines. The latter characteristic provides additional flexibility, nowadays present in many manufacturing systems. The problem is complicated by the need to determine both the operation sequence and starting time as well as the speed at which machines process each operation. Due to the adherence to renewable energy production and its intermittent nature, manufacturing companies need to adopt power-flexible production schedules. The proposed power control strategies, that is, adjusting processing speed and timing to reduce peak power requirements may impact production time (makespan) and energy consumption. Therefore, we propose a bi-objective approach that minimizes both objectives. A linear programming model is developed to provide a formal statement of the problem, which is solved to optimality for small-sized instances. We also proposed a multi-objective biased random key genetic algorithm framework that evolves several populations in parallel. Computational experiments provide decision and policymakers with insights into the implications of imposing or negotiating power consumption limits. Finally, the several trade-off solutions obtained show that as the power limit is lowered, the makespan increases at an increasing rate and a similar trend is observed in energy consumption but only for very small makespan values. Furthermore, peak power demand reductions of about 25% have a limited impact on the minimum makespan value (4-6% increase), while at the same time allowing for a small reduction in energy consumption.

学科与关键词

关键词
job shop scheduling problemenergy efficiencypeak powerspeed-adjustable machinesbiased random key genetic algorithm
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
International Transactions in Operational Research
发表日期
2025-01
卷期
第 32 卷, 第 1 期
页码
194-220
DOI
10.1111/itor.13414
语言
ENGLISH
成果收录
SCIE
资助标注
Projekt DEAL

作者

  • H

    Homayouni, S. Mahdi (通讯) (第一作者)

  • F

    Fontes, Dalila B. M. M.

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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