Pages that link to "Item:Q611469"

The following pages link to Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (Q611469):

Displaying 5 items.

• Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints (Q356114) (← links)
• Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times (Q2244222) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times (Q6094376) (← links)
• Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times (Q6157771) (← links)