Pages that link to "Item:Q1278198"

The following pages link to A fast tabu search algorithm for the permutation flow-shop problem (Q1278198):

Displaying 50 items.

• An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
• Carbon-efficient scheduling of flow shops by multi-objective optimization (Q320773) (← links)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• Resource leveling in a machine environment (Q418090) (← links)
• A special combinatorial problem: pitch arrangement for pneumatic tires (Q543503) (← links)
• A unified framework for population-based metaheuristics (Q646652) (← links)
• On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
• Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines (Q828672) (← links)
• Makespan distribution of permutation flowshop schedules (Q835630) (← links)
• 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)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
• Graph coloring by multiagent fusion search (Q1037448) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• Restricted neighborhood in the tabu search for the flowshop problem (Q1203798) (← 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)
• A tabu search approach for the flow shop scheduling problem (Q1296693) (← links)
• A tabu search algorithm for the open shop scheduling problem (Q1302574) (← 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)
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
• Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem (Q1676480) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• Bacterial foraging-tabu search metaheuristics for identification of nonlinear friction model (Q1760596) (← links)
• On single-walk parallelization of the job shop problem solving algorithms (Q1761161) (← 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 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)
• Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)