Pages that link to "Item:Q1943639"
From MaRDI portal
The following pages link to Approximation algorithms for parallel open shop scheduling (Q1943639):
Displaying 11 items.
- Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
- Approximation algorithms for the multiprocessor open shop scheduling problem (Q1306353) (← links)
- Worst-case analysis of heuristics for open shops with parallel machines (Q1310023) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
- Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
- Approximation Algorithms for Three-Machine Open Shop Scheduling (Q4282281) (← links)
- Openshop scheduling under linear resources constraints (Q4381875) (← links)
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
- Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)