Scheduling with step-improving processing times
From MaRDI portal
Publication:2583705
Recommendations
- A simple linear time algorithm for scheduling with step-improving processing times
- Single machine scheduling with step-deteriorating processing times
- Scheduling with step-deteriorating jobs to minimize the makespan
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
Cites work
Cited in
(5)- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Moving to higher directional scheduling schemes
- A simple linear time algorithm for scheduling with step-improving processing times
- scientific article; zbMATH DE number 2159168 (Why is no real title available?)
- Performance guarantees for a scheduling problem with common stepwise job payoffs
This page was built for publication: Scheduling with step-improving processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583705)