Pages that link to "Item:Q2239884"
From MaRDI portal
The following pages link to Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884):
Displaying 14 items.
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- Global lower bounds for flow shops with multiple processors (Q1129960) (← links)
- Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
- An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (Q1644059) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Decentralized task coordination (Q2171631) (← links)
- A column generation-based heuristic for a rehabilitation patient scheduling and routing problem (Q2676370) (← links)
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function (Q5471126) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← 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)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)
