scientific article; zbMATH DE number 6490206
From MaRDI portal
Publication:2948897
Recommendations
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- On-line scheduling of parallel machines to minimize total completion times
- Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines
Cited in
(25)- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- Single-machine online scheduling of jobs with non-delayed processing constraint
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model
- Single machine scheduling with rejection to minimize the weighted makespan
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
- Online NDP-constraint scheduling of jobs with delivery times or weights
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
- Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
- Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
- On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan
- Online single-processor scheduling with an unexpected breakdown
- Single machine scheduling with a restricted rate-modifying activity to minimize the weighted makespan
- Order acceptance and scheduling with weighted makespan
- Minimizing the total completion time for a class of semi-online single machine scheduling problems
- Single machine lot scheduling to minimize maximum weighted completion time
- Single machine lot scheduling to minimize maximum weighted completion time
- Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
- Single machine scheduling with a restricted weight-modifying activity to minimize the weighted makespan
- Approximation algorithms for the parallel-machine customer order scheduling with weighted and submodular rejection penalties
- Minimizing the weighted makespan with restarts on a single machine
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948897)
