A greedy approach for a time-dependent scheduling problem
From MaRDI portal
Recommendations
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
- scientific article; zbMATH DE number 6378894
- Approximate solution of a time-dependent scheduling problem for l_p-norm-based criteria.
- Single-machine scheduling problems with start-time dependent processing time
- Scheduling jobs with varying processing times
Cited in
(12)- Conjugate problems in time-dependent scheduling
- Equivalent time-dependent scheduling problems
- A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
- A concise survey of scheduling with time-dependent processing times
- A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
- scientific article; zbMATH DE number 6378894 (Why is no real title available?)
- Approximate solution of a time-dependent scheduling problem for l_p-norm-based criteria.
- Theory and methodology of time-dependent scheduling: past, present and future
- Scheduling algorithms for procrastinators
This page was built for publication: A greedy approach for a time-dependent scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737345)