Vector scheduling with rejection on a single machine
From MaRDI portal
Publication:1743644
DOI10.1007/s10288-017-0356-0zbMath1384.90046OpenAlexW2766639815MaRDI QIDQ1743644
Publication date: 13 April 2018
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-017-0356-0
dynamic programmingapproximation algorithmsfully polynomial time approximation schemevector scheduling
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (4)
Vector scheduling with rejection on two machines ⋮ Approximation scheme for single-machine rescheduling with job delay and rejection ⋮ On-line single machine scheduling with release dates and submodular rejection penalties ⋮ Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
Cites Work
- Unnamed Item
- Unnamed Item
- Improved algorithms for single machine scheduling with release dates and rejections
- Faster algorithms for single machine scheduling with release dates and rejection
- Parallel-machine scheduling with release dates and rejection
- A survey on offline scheduling with rejection
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
- Approximating vector scheduling: almost matching upper and lower bounds
- A new polynomial-time algorithm for linear programming
- Penalty cost constrained identical parallel machine scheduling problem
- Single-machine scheduling under the job rejection constraint
- Single machine scheduling with release dates and rejection
- Approximation schemes for scheduling on parallel machines
- Scheduling with release times and rejection on two parallel machines
- Approximation and online algorithms for multidimensional bin packing: a survey
- Online vector scheduling and generalized load balancing
- Vector assignment schemes for asymmetric settings
- An improved heuristic for parallel machine scheduling with rejection
- Online Multidimensional Load Balancing
- Vector assignment problems: a general framework
- Tight Bounds for Online Vector Scheduling
- On Multidimensional Packing Problems
- Multiprocessor Scheduling with Rejection
- On the optimality of approximation schemes for the classical scheduling problem
This page was built for publication: Vector scheduling with rejection on a single machine
