具有交货时间、可变处理时间和外包的单机共同/松弛到期窗口作业调度研究

IF 4.6 Q2 MATERIALS SCIENCE, BIOMATERIALS ACS Applied Bio Materials Pub Date : 2024-09-15 DOI:10.3390/math12182883
Bing Bai, Cai-Min Wei, Hong-Yu He, Ji-Bo Wang
{"title":"具有交货时间、可变处理时间和外包的单机共同/松弛到期窗口作业调度研究","authors":"Bing Bai, Cai-Min Wei, Hong-Yu He, Ji-Bo Wang","doi":"10.3390/math12182883","DOIUrl":null,"url":null,"abstract":"Single-machine due-window assignment scheduling with delivery times and variable processing times is investigated, where the variable processing time of a job means that the processing time is a function of its position in a sequence and its resource allocation. Currently, there are multiple optimization objectives for the due-window assignment problem, and there is a small amount of research on optimization problems where the window starting time, the rejected cost and the optimal scheduling are jointly required. The goal of this paper is to minimize the weighed sum of scheduling cost, resource consumption cost and outsourcing measure under the optional job outsourcing (rejection). Under two resource allocation models (i.e., linear and convex resource allocation models), the scheduling cost is the weighted sum of the number of early–tardy jobs, earliness–tardiness penalties and due-window starting time and size, where the weights are positional-dependent. The main contributions of this paper include the study and data simulation of single-machine scheduling with learning effects, delivery times and outsourcing cost. For the weighed sum of scheduling cost, resource consumption cost and outsourcing measure, we prove the polynomial solvability of the problem. Under the common and slack due-window assignments, through the theoretical analysis of the optimal solution, we reveal that four problems can be solved in O(n6) time, where n is the number of jobs.","PeriodicalId":2,"journal":{"name":"ACS Applied Bio Materials","volume":null,"pages":null},"PeriodicalIF":4.6000,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Study on Single-Machine Common/Slack Due-Window Assignment Scheduling with Delivery Times, Variable Processing Times and Outsourcing\",\"authors\":\"Bing Bai, Cai-Min Wei, Hong-Yu He, Ji-Bo Wang\",\"doi\":\"10.3390/math12182883\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Single-machine due-window assignment scheduling with delivery times and variable processing times is investigated, where the variable processing time of a job means that the processing time is a function of its position in a sequence and its resource allocation. Currently, there are multiple optimization objectives for the due-window assignment problem, and there is a small amount of research on optimization problems where the window starting time, the rejected cost and the optimal scheduling are jointly required. The goal of this paper is to minimize the weighed sum of scheduling cost, resource consumption cost and outsourcing measure under the optional job outsourcing (rejection). Under two resource allocation models (i.e., linear and convex resource allocation models), the scheduling cost is the weighted sum of the number of early–tardy jobs, earliness–tardiness penalties and due-window starting time and size, where the weights are positional-dependent. The main contributions of this paper include the study and data simulation of single-machine scheduling with learning effects, delivery times and outsourcing cost. For the weighed sum of scheduling cost, resource consumption cost and outsourcing measure, we prove the polynomial solvability of the problem. Under the common and slack due-window assignments, through the theoretical analysis of the optimal solution, we reveal that four problems can be solved in O(n6) time, where n is the number of jobs.\",\"PeriodicalId\":2,\"journal\":{\"name\":\"ACS Applied Bio Materials\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.6000,\"publicationDate\":\"2024-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACS Applied Bio Materials\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.3390/math12182883\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATERIALS SCIENCE, BIOMATERIALS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Applied Bio Materials","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.3390/math12182883","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATERIALS SCIENCE, BIOMATERIALS","Score":null,"Total":0}
引用次数: 0

摘要

研究了具有交货时间和可变处理时间的单机到期窗口分配调度,其中作业的可变处理时间意味着处理时间是其在序列中的位置和资源分配的函数。目前,到期窗口分配问题有多个优化目标,而对窗口起始时间、拒绝成本和优化调度共同要求的优化问题的研究较少。本文的目标是在可选工作外包(拒绝)的情况下,使调度成本、资源消耗成本和外包措施的权重之和最小化。在两种资源分配模型(即线性资源分配模型和凸资源分配模型)下,调度成本是早迟到作业数量、早迟到惩罚和到期窗口开始时间及大小的加权和,其中权重与位置有关。本文的主要贡献包括对具有学习效应、交货时间和外包成本的单机调度进行了研究和数据模拟。对于调度成本、资源消耗成本和外包成本的权重和,我们证明了问题的多项式可解性。在普通和松弛的到期窗口分配下,通过最优解的理论分析,我们发现四个问题可以在 O(n6) 时间内求解,其中 n 为作业数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Study on Single-Machine Common/Slack Due-Window Assignment Scheduling with Delivery Times, Variable Processing Times and Outsourcing
Single-machine due-window assignment scheduling with delivery times and variable processing times is investigated, where the variable processing time of a job means that the processing time is a function of its position in a sequence and its resource allocation. Currently, there are multiple optimization objectives for the due-window assignment problem, and there is a small amount of research on optimization problems where the window starting time, the rejected cost and the optimal scheduling are jointly required. The goal of this paper is to minimize the weighed sum of scheduling cost, resource consumption cost and outsourcing measure under the optional job outsourcing (rejection). Under two resource allocation models (i.e., linear and convex resource allocation models), the scheduling cost is the weighted sum of the number of early–tardy jobs, earliness–tardiness penalties and due-window starting time and size, where the weights are positional-dependent. The main contributions of this paper include the study and data simulation of single-machine scheduling with learning effects, delivery times and outsourcing cost. For the weighed sum of scheduling cost, resource consumption cost and outsourcing measure, we prove the polynomial solvability of the problem. Under the common and slack due-window assignments, through the theoretical analysis of the optimal solution, we reveal that four problems can be solved in O(n6) time, where n is the number of jobs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
ACS Applied Bio Materials
ACS Applied Bio Materials Chemistry-Chemistry (all)
CiteScore
9.40
自引率
2.10%
发文量
464
期刊最新文献
A Systematic Review of Sleep Disturbance in Idiopathic Intracranial Hypertension. Advancing Patient Education in Idiopathic Intracranial Hypertension: The Promise of Large Language Models. Anti-Myelin-Associated Glycoprotein Neuropathy: Recent Developments. Approach to Managing the Initial Presentation of Multiple Sclerosis: A Worldwide Practice Survey. Association Between LACE+ Index Risk Category and 90-Day Mortality After Stroke.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1