Pages that link to "Item:Q1273127"
From MaRDI portal
The following pages link to A greedy open shop heuristic with job priorities (Q1273127):
Displaying 7 items.
- A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← 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)
- Open shop scheduling problem with a non-resumable flexible maintenance period (Q2150575) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan (Q3102811) (← links)
- Approximation Algorithms for Three-Machine Open Shop Scheduling (Q4282281) (← links)