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 32 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)
- A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. (Q1427559) (← links)
- Modelling multi-stage manufacturing systems for efficient scheduling (Q1582191) (← links)
- The convergence of stochastic algorithms solving flow shop scheduling (Q1608340) (← links)
- A tabu search algorithm for parallel machine total tardiness problem (Q1765548) (← links)
- Scheduling flexible flow lines with sequence-dependent setup times (Q1876159) (← links)
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation (Q1887965) (← links)
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- A scheduling problem in the baking industry (Q2336885) (← links)
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249) (← links)
- An integrated approach for modeling and solving the scheduling problem of container handling systems (Q2508124) (← links)
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
- Optimal versus heuristic scheduling of surface mount technology lines (Q3159686) (← links)
- Research on <i>m</i>‐machine flow shop scheduling with truncated learning effects (Q6088136) (← links)