沈阳航空航天大学学报2024，Vol.41Issue(5)：90-94,5.DOI:10.3969/j.issn.2095-1248.2024.05.010
具有共同窗口和可拒绝工件的排序问题
The scheduling problem with common due-window and job-rejection
摘要
Abstract
It was considered that a single-machine scheduling problem with job-rejection and common due-window,which the starting time and finishing time of the common due-window were decision vari-ables.If the job was completed in the common due-window,no additional cost would be incurred,other-wise,advance or delay costs would be incurred.If the job was rejected,a corresponding rejection cost wonld be incurred.The goal was to find out which jobs were accepted and rejected,the sequence of ac-cepted job set,the starting and finishing times of common due-window,so as to minimize the weighted sum of scheduling cost and rejection cost,which the weights were the position weights.Through theoret-ical analysis and algorithm design,it is proved that there is an optimal solution algorithm with lower time complexity.关键词
排序/可拒绝工件/单机/共同窗口/指派问题Key words
scheduling/job-rejection/single-machine/common due-window/assignment problem分类
数理科学引用本文复制引用
王吉波,邓文龙,吕丹阳,李明慧..具有共同窗口和可拒绝工件的排序问题[J].沈阳航空航天大学学报,2024,41(5):90-94,5.基金项目
辽宁省教育厅基础科研项目(项目编号:JYTMS20230278) （项目编号:JYTMS20230278）
