Pages that link to "Item:Q856670"
From MaRDI portal
The following pages link to 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):
Displaying 11 items.
- Optimizing blocking flow shop scheduling problem with total completion time criterion (Q336393) (← links)
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking (Q1615967) (← links)
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem (Q1725819) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
- On some lower bounds for the permutation flowshop problem (Q6047866) (← links)
- A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
