并行机上的 W-特权收集调度问题

IF 0.9 4区数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Combinatorial Optimization Pub Date : 2024-10-11 DOI:10.1007/s10878-024-01212-z

Bo Hou, Tianjiao Guo, Suogang Gao, Guanghua Wang, Weili Wu, Wen Liu

{"title":"并行机上的 W-特权收集调度问题","authors":"Bo Hou, Tianjiao Guo, Suogang Gao, Guanghua Wang, Weili Wu, Wen Liu","doi":"10.1007/s10878-024-01212-z","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the W-prize-collecting scheduling problem on parallel machines. In this problem, we are given a set of n jobs, a set of m identical parallel machines and a value W. Each job \\(J_j\\) has a processing time, a profit and a rejection penalty. Each job is either accepted and processed on one of the machines without preemption, or rejected and paid a rejection penalty. The objective is to minimize the sum of the makespan of accepted jobs and the penalties of rejected jobs, and at the same time the total profit brought by accepted jobs is not less than W. We design a 2-approximation algorithm for the problem based on the greedy method and the list scheduling algorithm.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"9 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"W-prize-collecting scheduling problem on parallel machines\",\"authors\":\"Bo Hou, Tianjiao Guo, Suogang Gao, Guanghua Wang, Weili Wu, Wen Liu\",\"doi\":\"10.1007/s10878-024-01212-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the W-prize-collecting scheduling problem on parallel machines. In this problem, we are given a set of n jobs, a set of m identical parallel machines and a value W. Each job \\\\(J_j\\\\) has a processing time, a profit and a rejection penalty. Each job is either accepted and processed on one of the machines without preemption, or rejected and paid a rejection penalty. The objective is to minimize the sum of the makespan of accepted jobs and the penalties of rejected jobs, and at the same time the total profit brought by accepted jobs is not less than W. We design a 2-approximation algorithm for the problem based on the greedy method and the list scheduling algorithm.\",\"PeriodicalId\":50231,\"journal\":{\"name\":\"Journal of Combinatorial Optimization\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-10-11\",\"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-024-01212-z\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01212-z","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们考虑的是并行机器上的 W-惩罚收集调度问题。在这个问题中，我们给定了一组 n 个作业、一组 m 台相同的并行机器和一个值 W。每个作业 \(J_j\) 都有一个处理时间、一个利润和一个拒绝惩罚。每个作业要么被接受并在其中一台机器上处理而不被抢占，要么被拒绝并支付拒绝罚金。我们设计了一种基于贪婪法和列表调度算法的 2-approximation 算法来解决这个问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

W-prize-collecting scheduling problem on parallel machines

查看原文本刊更多论文

W-prize-collecting scheduling problem on parallel machines

In this paper, we consider the W-prize-collecting scheduling problem on parallel machines. In this problem, we are given a set of n jobs, a set of m identical parallel machines and a value W. Each job \(J_j\) has a processing time, a profit and a rejection penalty. Each job is either accepted and processed on one of the machines without preemption, or rejected and paid a rejection penalty. The objective is to minimize the sum of the makespan of accepted jobs and the penalties of rejected jobs, and at the same time the total profit brought by accepted jobs is not less than W. We design a 2-approximation algorithm for the problem based on the greedy method and the list scheduling algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Combinatorial Optimization 数学-计算机：跨学科应用

CiteScore

2.00

自引率

10.00%

发文量

审稿时长

6 months

期刊介绍： 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.