Pages that link to "Item:Q4072835"

The following pages link to Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem <i>n / 2 / F / F¯</i> (Q4072835):

Displaying 13 items.

• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop (Q582206) (← links)
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← links)
• A two-machine flowshop problem with two agents (Q709115) (← links)
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
• Lower bounds for minimizing total completion time in a two-machine flow shop (Q880570) (← links)
• A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
• The two-machine total completion time flow shop problem (Q1266536) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• Using branch-and-bound algorithms to obtain suboptimal solutions (Q3042297) (← links)
• A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime (Q3158872) (← links)
• Two- and three-machine flow shop scheduling problems with equal sized transfer batches (Q4008519) (← links)
• The permutation flow shop problem with sum-of-completion times performance criterion (Q4279265) (← links)
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP (Q5708850) (← links)