Single Machine Scheduling with Rejection and a Non-Availability Interval to Minimize the Maximum Delivery Completion Time Plus the Total Rejection Cost
{"title":"Single Machine Scheduling with Rejection and a Non-Availability Interval to Minimize the Maximum Delivery Completion Time Plus the Total Rejection Cost","authors":"Lili Zuo, Lingfa Lu, Liqi Zhang","doi":"10.1142/s0217595923400171","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the single machine scheduling with rejection and a non-availability interval. Two types of non-availability intervals are studied, namely the machine non-availability (MNA) intervals and the operator non-availability (ONA) intervals. The objective is to minimize the sum of the maximum delivery completion time of accepted jobs and the total rejection cost of rejected jobs. For these two problems, a pseudo-polynomial-time dynamic programming algorithm and a fully polynomial-time approximation scheme (FPTAS) are proposed, respectively.","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asia-Pacific Journal of Operational Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1142/s0217595923400171","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we consider the single machine scheduling with rejection and a non-availability interval. Two types of non-availability intervals are studied, namely the machine non-availability (MNA) intervals and the operator non-availability (ONA) intervals. The objective is to minimize the sum of the maximum delivery completion time of accepted jobs and the total rejection cost of rejected jobs. For these two problems, a pseudo-polynomial-time dynamic programming algorithm and a fully polynomial-time approximation scheme (FPTAS) are proposed, respectively.
期刊介绍：
The Asia-Pacific Journal of Operational Research (APJOR) provides a forum for practitioners, academics and researchers in Operational Research and related fields, within and beyond the Asia-Pacific region.
APJOR will place submissions in one of the following categories: General, Theoretical, OR Practice, Reviewer Survey, OR Education, and Communications (including short articles and letters). Theoretical papers should carry significant methodological developments. Emphasis is on originality, quality and importance, with particular emphasis given to the practical significance of the results. Practical papers, illustrating the application of Operation Research, are of special interest.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
