Pages that link to "Item:Q1183390"
From MaRDI portal
The following pages link to Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling (Q1183390):
Displaying 8 items.
- New results in the worst-case analysis for flow-shop scheduling (Q689950) (← links)
- A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← 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)
- A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557) (← links)
- Non-bottleneck machines in three-machine flow shops (Q1585915) (← links)
- Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
- Experimental comparison of heuristics for flow shop scheduling (Q4812723) (← links)
