Pages that link to "Item:Q1278537"
From MaRDI portal
The following pages link to A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537):
Displaying 11 items.
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems (Q856670) (← links)
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) (← 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)
- Survey on fuzzy shop scheduling (Q1794871) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) (← links)
- USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS (Q3638815) (← links)
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715) (← links)
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)
