Pages that link to "Item:Q689950"

The following pages link to New results in the worst-case analysis for flow-shop scheduling (Q689950):

Displaying 11 items.

• A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed (Q852963) (← links)
• 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 two-machine permutation flow shop scheduling problem with buffers (Q1286775) (← 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)
• An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
• Experimental comparison of heuristics for flow shop scheduling (Q4812723) (← links)