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 40 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)
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers (Q955624) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- Restricted neighborhood in the tabu search for the flowshop problem (Q1203798) (← links)
- A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
- Tabu search for total tardiness minimization in flowshop scheduling problems (Q1302584) (← links)
- A tabu search algorithm for the open shop problem (Q1383321) (← 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)
- An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem (Q1771205) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958) (← links)
- A neuro-tabu search heuristic for the flow shop scheduling problem (Q1885991) (← links)
- The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
- Applying tabu search to the job-shop scheduling problem (Q2367003) (← 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 fast tabu search algorithm for the group shop scheduling problem (Q2485226) (← 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)
- An adaptive hybrid metaheuristic for permutation flowshop scheduling (Q2731683) (← links)
- Solving multi-objective production scheduling problems with tabu search (Q2731687) (← links)
- A pruning pattern list approach to the permutation flowshop scheduling problem. (Q2776579) (← 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)
- Evaluating the performance of tabu search procedures for flow shop sequencing (Q3157811) (← links)
- An improved genetic algorithm for the flowshop scheduling problem (Q3596697) (← links)
- (Q3987193) (← links)
- Application of tabu search to process plan optimization for four-axis CNC turning centres (Q4497160) (← links)
- Scheduling in flowshops to minimize total tardiness of jobs (Q4671257) (← links)
- Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study (Q4671306) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs (Q5935393) (← links)
- Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect (Q6191395) (← links)