Pages that link to "Item:Q1330557"

The following pages link to A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557):

Displaying 6 items.

• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← 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)
• Experimental comparison of heuristics for flow shop scheduling (Q4812723) (← links)