Pages that link to "Item:Q1278198"
From MaRDI portal
The following pages link to A fast tabu search algorithm for the permutation flow-shop problem (Q1278198):
Displayed 40 items.
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
- Considering scheduling and preventive maintenance in the flowshop sequencing problem (Q883296) (← links)
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- A two-machine permutation flow shop scheduling problem with buffers (Q1286775) (← links)
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. (Q1399596) (← links)
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (Q1427562) (← links)
- Sequencing of jobs in some production system (Q1582040) (← links)
- The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling (Q1592285) (← links)
- Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
- A tabu search algorithm for scheduling a single robot in a job-shop environment (Q1602712) (← links)
- The flow shop with parallel machines: A tabu search approach (Q1609888) (← links)
- The permutation flow shop with buffers: A tabu search approach (Q1610144) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- Optimization of pitch sequencing for pneumatic tire by tabu search method (Q1859349) (← links)
- Scheduling flexible flow lines with sequence-dependent setup times (Q1876159) (← 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)
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249) (← links)
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers (Q2489134) (← links)
- Genetic local search for multi-objective flowshop scheduling problems (Q2566706) (← links)
- Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions (Q3509420) (← links)
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers (Q3596695) (← links)
- An improved genetic algorithm for the flowshop scheduling problem (Q3596697) (← links)
- Scheduling in flowshops to minimize total tardiness of jobs (Q4671257) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)