Pages that link to "Item:Q2147068"
From MaRDI portal
The following pages link to Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068):
Displaying 10 items.
- Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
- A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures (Q2475628) (← links)
- (Q4822050) (← links)
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function (Q5471126) (← links)
- An FPTAS for scheduling with resource constraints (Q6047696) (← links)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)
- Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
