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 4 items.
- 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)
