Pages that link to "Item:Q3160580"
From MaRDI portal
The following pages link to Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs (Q3160580):
Displaying 8 items.
- Modeling the parallel machine scheduling problem with step deteriorating jobs (Q323474) (← links)
- Single machine group scheduling with decreasing time-dependent processing times subject to release dates (Q470781) (← links)
- A branch and bound algorithm for single machine scheduling with deteriorating values of jobs (Q611733) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration (Q833646) (← links)
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs (Q1886856) (← links)
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
- Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria (Q6669316) (← links)