Pages that link to "Item:Q1296692"

The following pages link to Some results of the worst-case analysis for flow shop scheduling (Q1296692):

Displaying 24 items.

• Several flow shop scheduling problems with truncated position-based learning effect (Q336658) (← links)
• Flowshop scheduling with a general exponential learning effect (Q336933) (← links)
• Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
• Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← links)
• Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108) (← links)
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed (Q852963) (← links)
• A note on flow shop scheduling problems with a learning effect on no-idle dominant machines (Q879575) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
• A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
• Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects (Q2008062) (← links)
• Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines (Q2370335) (← links)
• Research on permutation flow shop scheduling problems with general position-dependent learning effects (Q2449372) (← links)
• Some results of the worst-case analysis for flow shop scheduling with a learning effect (Q2449373) (← links)
• Flowshop scheduling research after five decades (Q2572844) (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
• A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
• A modification to the CGPS algorithm for three-machine flow shop scheduling (Q2766119) (← links)
• A worst-case analysis of the three-machine flow shop scheduling (Q4812717) (← links)
• Experimental comparison of heuristics for flow shop scheduling (Q4812723) (← links)
• An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion (Q4812724) (← links)
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds (Q5478829) (← links)
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem (Q5946533) (← links)
• A note on weighted completion time minimization in a flexible flow shop (Q5949902) (← links)