On-line single machine scheduling with release dates and submodular rejection penalties
From MaRDI portal
Publication:6167007
Recommendations
- Algorithms for single machine scheduling problem with release dates and submodular penalties
- Single machine scheduling with release dates and rejection
- Scheduling on single machine and identical machines with rejection
- Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
Cites work
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- An improved heuristic for parallel machine scheduling with rejection
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Approximation algorithms for the multiprocessor scheduling with submodular penalties
- Multiprocessor Scheduling with Rejection
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Penalty cost constrained identical parallel machine scheduling problem
- Preemptive multiprocessor scheduling with rejection
- Single machine scheduling with release dates and rejection
- Vector scheduling with rejection on a single machine
- Vector scheduling with rejection on two machines
Cited in
(2)
This page was built for publication: On-line single machine scheduling with release dates and submodular rejection penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167007)