Pages that link to "Item:Q1041934"
From MaRDI portal
The following pages link to Equivalent time-dependent scheduling problems (Q1041934):
Displaying 16 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration (Q611516) (← links)
- Isomorphic scheduling problems (Q744639) (← links)
- Scheduling time-dependent jobs under mixed deterioration (Q963924) (← links)
- Conjugate problems in time-dependent scheduling (Q1041348) (← links)
- Equivalence of mean flow time problems and mean absolute deviation problems (Q1173904) (← links)
- Some remarks about the `equivalence' of performance measures in scheduling problems (Q1310028) (← links)
- OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success (Q1719084) (← links)
- Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times (Q1725594) (← links)
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices (Q2190797) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Variants of Multi-resource Scheduling Problems with Equal Processing Times (Q3467836) (← links)
- Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423) (← links)
- Time-of-use scheduling problem with equal-length jobs (Q6111939) (← links)
