Pages that link to "Item:Q2470098"
From MaRDI portal
The following pages link to Parallel-machine scheduling with simple linear deterioration to minimize total completion time (Q2470098):
Displayed 10 items.
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration (Q437051) (← links)
- Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
- Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
- Parallel-machine scheduling of simple linear deteriorating jobs (Q837167) (← links)
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan (Q975438) (← links)
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
- A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099) (← links)
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines (Q2379563) (← links)