A new polynomial algorithm for a parallel identical scheduling problem
From MaRDI portal
Recommendations
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- Optimal scheduling on parallel machines for a new order class
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- On a parallel machine scheduling problem with equal processing times
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
Cites work
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 724323 (Why is no real title available?)
- Ideal preemptive schedules on two processors
- Minimizing total completion time for UET tasks with release time and outtree precedence constraints
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Optimal scheduling for two-processor systems
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- The complexity of mean flow time scheduling problems with release times
Cited in
(4)- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- scientific article; zbMATH DE number 6007890 (Why is no real title available?)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
This page was built for publication: A new polynomial algorithm for a parallel identical scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517881)
