Pages that link to "Item:Q1609888"
From MaRDI portal
The following pages link to The flow shop with parallel machines: A tabu search approach (Q1609888):
Displaying 11 items.
- A parallel tabu search for solving the primal buffer allocation problem in serial production systems (Q342074) (← links)
- Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises (Q492824) (← links)
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation (Q506145) (← links)
- Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments (Q712676) (← links)
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines (Q878937) (← links)
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034) (← links)
- Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines (Q962838) (← links)
- Research on <i>m</i>‐machine flow shop scheduling with truncated learning effects (Q6088136) (← links)
