A Hybrid Method of Heuristic Algorithm and Constraint Programming for No-wait Integrated Scheduling Problem

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Zhiqiang Xie, Xiaowei Zhang, Yingchun Xia, Jing Yang, Y. Xin
{"title":"A Hybrid Method of Heuristic Algorithm and Constraint Programming for No-wait Integrated Scheduling Problem","authors":"Zhiqiang Xie, Xiaowei Zhang, Yingchun Xia, Jing Yang, Y. Xin","doi":"10.53106/160792642021092205012","DOIUrl":null,"url":null,"abstract":"No-wait Integrated Scheduling Problem (NISP) describes a real-life process of the non-standard products where the consideration is given to the great structure differences, processing parameter differences, no-wait constraint, and the need for further deep processing after assembly of jobs. To deal with the dynamic orders of non-standard products, the scheduling algorithm to be design should be a dynamic algorithm with the ability to deal with the above conditions. At first, the dynamic scheduling problem is transformed to a series of continuous static scheduling problem by adoption of window-based event-driven strategy, thus establishing constraint programming model targeted at minimal total tardiness and thereby proposing a hybrid method of Heuristic Algorithm and Constraint Programming (HA-CP) for the problem. In order to enhance the ability to response the dynamic orders of non-standard products, HA-CP adopts heuristic algorithm to generate a pre-scheduling solution at each dynamic event moment, so that jobs that fall into the window period are labelled as dispatched jobs, while the remaining jobs are labelled as jobs to be dispatched. To improve solution quality, the jobs to be dispatched are mapped into an operation-based constraint programming model, then, during the execution interval of dispatched jobs, constraint programming solver starts to solve the jobs to be dispatched and update the current solution if the solver gets a better solution within the execution interval. The above procedures are repeated until all jobs are scheduled. Finally, the results of simulation experiment show that the proposed algorithm is effective and feasible.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"22 1","pages":"1083-1090"},"PeriodicalIF":0.9000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Internet Technology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.53106/160792642021092205012","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 2

Abstract

No-wait Integrated Scheduling Problem (NISP) describes a real-life process of the non-standard products where the consideration is given to the great structure differences, processing parameter differences, no-wait constraint, and the need for further deep processing after assembly of jobs. To deal with the dynamic orders of non-standard products, the scheduling algorithm to be design should be a dynamic algorithm with the ability to deal with the above conditions. At first, the dynamic scheduling problem is transformed to a series of continuous static scheduling problem by adoption of window-based event-driven strategy, thus establishing constraint programming model targeted at minimal total tardiness and thereby proposing a hybrid method of Heuristic Algorithm and Constraint Programming (HA-CP) for the problem. In order to enhance the ability to response the dynamic orders of non-standard products, HA-CP adopts heuristic algorithm to generate a pre-scheduling solution at each dynamic event moment, so that jobs that fall into the window period are labelled as dispatched jobs, while the remaining jobs are labelled as jobs to be dispatched. To improve solution quality, the jobs to be dispatched are mapped into an operation-based constraint programming model, then, during the execution interval of dispatched jobs, constraint programming solver starts to solve the jobs to be dispatched and update the current solution if the solver gets a better solution within the execution interval. The above procedures are repeated until all jobs are scheduled. Finally, the results of simulation experiment show that the proposed algorithm is effective and feasible.
无等待综合调度问题的启发式算法与约束规划混合方法
无等待集成调度问题(NISP)描述了非标准产品的真实过程,其中考虑了巨大的结构差异、加工参数差异、无等待约束以及在组装作业后需要进一步的深加工。为了处理非标准产品的动态订单,要设计的调度算法应该是能够处理上述条件的动态算法。首先,采用基于窗口的事件驱动策略,将动态调度问题转化为一系列连续静态调度问题,从而建立了以最小总延迟为目标的约束规划模型,并提出了启发式算法和约束规划的混合方法。为了增强对非标准产品动态订单的响应能力,HA-CP采用启发式算法在每个动态事件时刻生成预调度解决方案,将落入窗口期的作业标记为已调度作业,将剩余作业标记为待调度作业。为了提高解决方案质量,将要调度的作业映射到基于操作的约束编程模型中,然后,在调度作业的执行间隔期间,约束编程求解器开始求解要调度的任务,如果求解器在执行间隔内获得更好的解决方案,则更新当前解决方案。重复上述过程,直到安排好所有作业。最后,仿真实验结果表明,该算法是有效可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Internet Technology
Journal of Internet Technology COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
3.20
自引率
18.80%
发文量
112
审稿时长
13.8 months
期刊介绍: The Journal of Internet Technology accepts original technical articles in all disciplines of Internet Technology & Applications. Manuscripts are submitted for review with the understanding that they have not been published elsewhere. Topics of interest to JIT include but not limited to: Broadband Networks Electronic service systems (Internet, Intranet, Extranet, E-Commerce, E-Business) Network Management Network Operating System (NOS) Intelligent systems engineering Government or Staff Jobs Computerization National Information Policy Multimedia systems Network Behavior Modeling Wireless/Satellite Communication Digital Library Distance Learning Internet/WWW Applications Telecommunication Networks Security in Networks and Systems Cloud Computing Internet of Things (IoT) IPv6 related topics are especially welcome.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信