{"title":"Implications of refurbishing authorization strategy and distribution channel choice in a closed-loop supply chain","authors":"Xujin Pu, Mingzhuo Dai, Wen Zhang","doi":"10.1142/s0217595923500331","DOIUrl":"https://doi.org/10.1142/s0217595923500331","url":null,"abstract":"","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135566612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On proper separation theorems by means of the quasi-relative interior with applications","authors":"Tijani Amahroq, Hassan Khatite, Abdessamad Oussarhan","doi":"10.1142/s021759592350032x","DOIUrl":"https://doi.org/10.1142/s021759592350032x","url":null,"abstract":"","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":"2 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135566635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Competitive influence maximization with uncertain competitor sources and the bandwagon effect in social networks","authors":"Tao Sun, Suning Gong, Guo-Qiang Fan, Gongjie Xu","doi":"10.1142/s0217595923500343","DOIUrl":"https://doi.org/10.1142/s0217595923500343","url":null,"abstract":"","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":"49 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135567043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Preface — Special Issue: Machine Learning and Optimization II","authors":"Yong Chen, Dingzhu Du, Chenchen Wu","doi":"10.1142/s0217595923020037","DOIUrl":"https://doi.org/10.1142/s0217595923020037","url":null,"abstract":"","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43606154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ji-Bo Wang, Yi-Chun Wang, Congying Wan, Dan-Yang Lv, Lei Zhang
{"title":"Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs","authors":"Ji-Bo Wang, Yi-Chun Wang, Congying Wan, Dan-Yang Lv, Lei Zhang","doi":"10.1142/s0217595923500264","DOIUrl":"https://doi.org/10.1142/s0217595923500264","url":null,"abstract":"","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46015579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Preface: Special Issue of “Machine Learning and Optimization of MLO 2022”","authors":"Yong Chen, Dingzhu Du, Chenchen Wu","doi":"10.1142/s0217595923020025","DOIUrl":"https://doi.org/10.1142/s0217595923020025","url":null,"abstract":"","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46208027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Minimizing Total Weighted Late Work in a Proportionate Flow Shop with Job Rejection","authors":"Ren-Xia Chen, Shisheng Li, Q. Feng","doi":"10.1142/s0217595923500239","DOIUrl":"https://doi.org/10.1142/s0217595923500239","url":null,"abstract":"In this paper, we investigate a scheduling problem with optional job rejection in a proportionate flow shop setting, where the job processing times are machine independent. A solution to our problem is characterized by (i) partitioning the set of jobs into a set of accepted jobs and a set of rejected jobs, and (ii) scheduling the accepted jobs in a proportionate flow shop setting. The aim is to find a solution to minimize the sum of total weighted late work of the accepted jobs and total rejection cost of the rejected jobs. When all jobs share a common due date, we show that the single-machine case is [Formula: see text]-hard by reduction from the Subset Sum problem. When the operations of all jobs have equal processing times, we solve the case in [Formula: see text] time by reducing it into a linear assignment problem. For the general problem, we first provide a pseudo-polynomial-time algorithm via the dynamic programming method, then we convert it into a fully polynomial time approximation scheme. As a byproduct, we also resolve an open question in the literature.","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47673662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}