\(W\)-prize-collecting scheduling problem on parallel machines

DOI10.1007/s10878-024-01212-zMaRDI QIDQ6646746

Suo-gang Gao, Bo Hou, Tianjiao Guo, Guanghua Wang, Weili Wu, Wen Liu

Publication date: 3 December 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmgreedy methodlist scheduling algorithmscheduling problem with rejection

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Parallel-machine scheduling with release dates and rejection
• Penalty cost constrained identical parallel machine scheduling problem
• Approximation algorithms for the multiprocessor scheduling with submodular penalties
• A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
• Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
• An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem
• A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Multiprocessor Scheduling with Rejection
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: \(W\)-prize-collecting scheduling problem on parallel machines