The following pages link to (Q3775317):
Displaying 23 items.
- Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← links)
- Single machine scheduling problem with controllable processing times and resource dependent release times (Q877039) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
- Single machine scheduling problem with a common deadline and resource dependent release dates (Q1178528) (← links)
- Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption (Q1341400) (← links)
- Resource cost aware scheduling (Q1750475) (← links)
- Convex resource allocation for minimizing the makespan in a single machine with job release dates (Q1881652) (← links)
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine (Q1885985) (← links)
- Minimizing the total weighted flow time in a single machine with controllable processing times (Q1886005) (← links)
- Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
- A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates (Q2489138) (← links)
- Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity (Q5744000) (← links)
