Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
From MaRDI portal
Publication:2168731
DOI10.1007/s10878-021-00842-xzbMath1498.90112OpenAlexW4206350528MaRDI QIDQ2168731
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00842-x
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Algorithms for single machine scheduling problem with release dates and submodular penalties ⋮ Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
Cites Work
- Unnamed Item
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
- Parallel-machine scheduling with release dates and rejection
- A survey on offline scheduling with rejection
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Scheduling tasks with communication delays on parallel processors
- Approximation algorithms for the multiprocessor scheduling with submodular penalties
- Scheduling with release times and rejection on two parallel machines
- Submodular functions and optimization.
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Multiprocessor Scheduling with Rejection
- Bounds for Certain Multiprocessing Anomalies
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
