Pages that link to "Item:Q1296091"
From MaRDI portal
The following pages link to Minimization of the makespan in a two-machine problem under given resource constraints (Q1296091):
Displayed 9 items.
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← 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)
- Scheduling with controllable release dates and processing times: Makespan minimization (Q2433440) (← links)
- Scheduling with controllable release dates and processing times: total completion time minimization (Q2433441) (← links)
- Two-machine open shop problem with controllable processing times (Q2467128) (← links)
- Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)