Approximation and randomization in scheduling
From MaRDI portal
Cited in
(9)- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Approximation algorithms for shop scheduling problems with minsum objective
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Unrelated machine scheduling with stochastic processing times
- Total completion time scheduling under scenarios
- Total completion time scheduling under scenarios
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
This page was built for publication: Approximation and randomization in scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723565)
