Pages that link to "Item:Q2356207"

The following pages link to The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207):

Displaying 11 items.

• The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
• Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption (Q320777) (← links)
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
• An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
• A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
• Comments on ``A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times'' (Q638896) (← links)
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
• Solving permutation flow shop scheduling problem with sequence-independent setup time (Q2176034) (← links)
• Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times (Q2861538) (← links)
• (Q5449457) (← links)
• Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times (Q6602333) (← links)