Pages that link to "Item:Q1886856"
From MaRDI portal
The following pages link to Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs (Q1886856):
Displaying 12 items.
- Modeling the parallel machine scheduling problem with step deteriorating jobs (Q323474) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration (Q833646) (← links)
- Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times (Q968039) (← links)
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs (Q988377) (← links)
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
- Scheduling with step-deteriorating jobs to minimize the makespan (Q2315619) (← links)
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
- Scheduling with step-improving processing times (Q2583705) (← links)
- Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs (Q3160580) (← links)
- Makespan minimization in single-machine scheduling with step-deterioration of processing times (Q4661099) (← links)
- Single-machine scheduling with deteriorating jobs (Q4909259) (← links)
- Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time (Q6053499) (← links)
