A fast tabu search algorithm for the permutation flow-shop problem

DOI10.1016/0377-2217(95)00037-2zbMath0947.90590OpenAlexW2018028283MaRDI QIDQ1278198

Eugeniusz Nowicki, Czesław Smutnicki

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00037-2

zbMATH Keywords

heuristicflow-shop schedulingtabu earch

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Scheduling flexible flow lines with sequence-dependent setup times, Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines, A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, A neuro-tabu search heuristic for the flow shop scheduling problem, Makespan distribution of permutation flowshop schedules, An effective differential evolution algorithm for permutation flow shop scheduling problem, Cyclic flow-shop scheduling with no-wait constraints and missing operations, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers, Carbon-efficient scheduling of flow shops by multi-objective optimization, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion, Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem, Solving permutation flow shop scheduling problem with sequence-independent setup time, Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem, Considering scheduling and preventive maintenance in the flowshop sequencing problem, Research on m‐machine flow shop scheduling with truncated learning effects, Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times., An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions, Resource leveling in a machine environment, The seeds of the NEH algorithm: an overview using bibliometric analysis, A unified framework for population-based metaheuristics, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs., An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers, An improved NEH heuristic to minimize makespan in permutation flow shops, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Bacterial foraging-tabu search metaheuristics for identification of nonlinear friction model, On single-walk parallelization of the job shop problem solving algorithms, A special combinatorial problem: pitch arrangement for pneumatic tires, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Scheduling in flowshops to minimize total tardiness of jobs, A comprehensive review and evaluation of permutation flowshop heuristics, A computational study of the permutation flow shop problem based on a tight lower bound, An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers, An improved genetic algorithm for the flowshop scheduling problem, A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems, Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling, Flowshop-scheduling problems with makespan criterion: a review, An exact block algorithm for no-idle RPQ problem, Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics, The evolution of schematic representations of flow shop scheduling problems, A hybrid genetic local search algorithm for the permutation flowshop scheduling problem, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, Forward Backward Transformation, Graph coloring by multiagent fusion search, A two-machine permutation flow shop scheduling problem with buffers, The distributed permutation flowshop scheduling problem, A new constructive heuristic for the flowshop scheduling problem, Genetic local search for multi-objective flowshop scheduling problems, A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective, Sequencing of jobs in some production system, Some results of the worst-case analysis for flow shop scheduling, Some aspects of scatter search in the flow-shop problem, Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach, A review of TSP based approaches for flowshop scheduling, The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling, Local search algorithms for the multiprocessor flow shop scheduling problem, Optimization of pitch sequencing for pneumatic tire by tabu search method, A tabu search algorithm for scheduling a single robot in a job-shop environment, The flow shop with parallel machines: A tabu search approach, The permutation flow shop with buffers: A tabu search approach

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• New results in the worst-case analysis for flow-shop scheduling
• On the heuristic solution of the permutation flow shop problem by path algorithms
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• A block approach for single-machine scheduling with release dates and due dates
• A new heuristic method for the flow shop sequencing problem
• Worst-case analysis of an approximation algorithm for flow-shop scheduling
• On two-machine scheduling with release and due dates to minimize maximum lateness
• Restricted neighborhood in the tabu search for the flowshop problem
• A note on worst-case analysis of approximation algorithms for a scheduling problem
• A new heuristic for the n-job, M-machine flow-shop problem
• Benchmarks for basic scheduling problems
• Applying tabu search to the job-shop scheduling problem
• On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
• Tabu Search—Part I
• Tabu Search—Part II
• Flowshop and Jobshop Schedules: Complexity and Approximation
• An Evaluation of Flow Shop Sequencing Heuristics
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem