Pages that link to "Item:Q1121778"

The following pages link to Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778):

Displaying 20 items.

• Using aggregation to reduce response time variability in cyclic fair sequences (Q633539) (← links)
• 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)
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed (Q852963) (← 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)
• Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
• Approximability of flow shop scheduling (Q1290640) (← 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)
• Worst-case analysis of an algorithm for cellular manufacturing (Q1309957) (← links)
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times (Q1310020) (← links)
• A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557) (← links)
• Scheduling in network flow shops (Q2564878) (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
• Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem (Q3611971) (← links)
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem (Q3757393) (← links)
• A worst-case analysis of the three-machine flow shop scheduling (Q4812717) (← links)
• Experimental comparison of heuristics for flow shop scheduling (Q4812723) (← links)
• How good is a dense shop schedule? (Q5931907) (← links)