Pages that link to "Item:Q5471126"
From MaRDI portal
The following pages link to Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function (Q5471126):
Displaying 13 items.
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
- Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← 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)
- Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)
- (Q3033546) (← links)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
- Two-machine flow shop scheduling with convex resource consumption functions (Q6097489) (← links)
