Pages that link to "Item:Q5937715"

The following pages link to A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715):

Displayed 2 items.

• Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) ‎ (← links)
• Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm (Q2476643) ‎ (← links)