Pages that link to "Item:Q4356673"
From MaRDI portal
The following pages link to Solving a class of two-resource allocation problem by equivalent load method (Q4356673):
Displaying 12 items.
- Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← 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)
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← 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)
- 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)
- 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)