Pages that link to "Item:Q1885985"
From MaRDI portal
The following pages link to Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine (Q1885985):
Displayed 13 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)
- 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 tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
- Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← 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 branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605) (← links)
- A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates (Q2489138) (← links)
- Scheduling parallel dedicated machines with the speeding‐up resource (Q5393022) (← links)