The following pages link to (Q3572159):
Displaying 17 items.
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- A single-machine scheduling with a truncated linear deterioration and ready times (Q497952) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration (Q611516) (← links)
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function (Q660909) (← links)
- Single-machine scheduling with nonlinear deterioration (Q691413) (← links)
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs (Q693149) (← links)
- Single machine scheduling with sum-of-logarithm-processing-times based deterioration (Q726391) (← links)
- Scheduling time-dependent jobs under mixed deterioration (Q963924) (← links)
- Single machine scheduling with decreasing linear deterioration under precedence constraints (Q980093) (← links)
- Scheduling jobs under decreasing linear deterioration (Q1041725) (← links)
- Scheduling jobs under simple linear deterioration (Q1332800) (← links)
- Single machine scheduling problems with deteriorating jobs (Q1764739) (← links)
- Single-machine scheduling with logarithm deterioration (Q1926617) (← links)
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences (Q2433803) (← links)
- The single-machine total tardiness problem with unequal release times and a linear deterioration (Q2511712) (← links)
- Single machine scheduling with time deteriorating job values (Q3505944) (← links)
- Scheduling deteriorating jobs on a single machine to minimize the maximum processing times (Q4883811) (← links)
