Scheduling with time-dependent execution times
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1187294
- A note on single-processor scheduling with time-dependent execution times
- A concise survey of scheduling with time-dependent processing times
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- Algorithms and Computation
Cited in
(14)- An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
- Scheduling with tails and deadlines
- Scheduling with time-dependent discrepancy times
- Greedy solutions of selection and ordering problems
- Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs
- Scheduling with target start times
- Optimal timing of a sequence of tasks with general completion costs
- Algorithms for dynamic scheduling of unit execution time tasks
- scientific article; zbMATH DE number 1187294 (Why is no real title available?)
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time-changing effects and rate-modifying activities
- A note on single-processor scheduling with time-dependent execution times
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs
This page was built for publication: Scheduling with time-dependent execution times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673610)