Pages that link to "Item:Q1296693"
From MaRDI portal
The following pages link to A tabu search approach for the flow shop scheduling problem (Q1296693):
Displaying 18 items.
- Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation (Q337206) (← links)
- A multi-objective particle swarm for a flow shop scheduling problem (Q867030) (← links)
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
- Two-machine flow shop problems with a single server (Q880567) (← links)
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. (Q1399596) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. (Q1410335) (← links)
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (Q1427562) (← links)
- Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- A neuro-tabu search heuristic for the flow shop scheduling problem (Q1885991) (← links)
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249) (← links)
- Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm (Q2476643) (← links)
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710) (← links)
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853) (← links)
- Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem (Q2814141) (← links)
- Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
- Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect (Q6191395) (← links)