{"title":"Scheduling problems with rejection in green manufacturing industry","authors":"Fanyu Kong, Jiaxin Song, Cuixia Miao, Yuzhong Zhang","doi":"10.1007/s10878-025-01295-2","DOIUrl":null,"url":null,"abstract":"<p>Green manufacturing is used to describe an environmentally friendly manufacturing approach, which explicitly considers the impact of production on the environment and resources. Therefore, the production scheduling of solving energy conscious is in line with the focus of green manufacturing. In this paper, we consider the scheduling problems with rejection in the green manufacturing industry. The objective is to minimize the makespan of the accepted jobs plus the total rejection penalty of the rejected jobs, subject to the constraint that the total machine cost of the processed jobs is not more than a given threshold. We present pseudo-polynomial time algorithms and 2-approximation algorithms for the single-machine and the parallel-machine problems, respectively.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"3 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2025-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-025-01295-2","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Green manufacturing is used to describe an environmentally friendly manufacturing approach, which explicitly considers the impact of production on the environment and resources. Therefore, the production scheduling of solving energy conscious is in line with the focus of green manufacturing. In this paper, we consider the scheduling problems with rejection in the green manufacturing industry. The objective is to minimize the makespan of the accepted jobs plus the total rejection penalty of the rejected jobs, subject to the constraint that the total machine cost of the processed jobs is not more than a given threshold. We present pseudo-polynomial time algorithms and 2-approximation algorithms for the single-machine and the parallel-machine problems, respectively.
期刊介绍：
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
