Pages that link to "Item:Q1330557"
From MaRDI portal
The following pages link to A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557):
Displaying 11 items.
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- A note on worst-case performance of heuristics for maintenance scheduling problems (Q868400) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778) (← links)
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling (Q1183390) (← links)
- A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
- Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
- Worst-case performance of approximation algorithms for tool management problems (Q4266753) (← links)
- Experimental comparison of heuristics for flow shop scheduling (Q4812723) (← links)