Pages that link to "Item:Q1806706"
From MaRDI portal
The following pages link to A 3/2 algorithm for two-machine open shop with route-dependent processing times (Q1806706):
Displaying 8 items.
- Two machine openshop scheduling with machine-dependent processing times (Q678857) (← links)
- Open shop scheduling with machine dependent processing times (Q1201806) (← links)
- Approximation algorithms for parallel open shop scheduling (Q1943639) (← 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)
- The 2-Machine Routing Open Shop on a Triangular Transportation Network (Q3133222) (← links)
- Approximation Algorithms for Three-Machine Open Shop Scheduling (Q4282281) (← links)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)