Routing and scheduling in a flexible job shop by tabu search

DOI10.1007/BF02023073zbMath0775.90227MaRDI QIDQ2366999

Paolo Brandimarte

Publication date: 16 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (85)

A priority-based genetic algorithm for a flexible job shop scheduling problem ⋮ A variable neighbourhood search algorithm for the flexible job-shop scheduling problem ⋮ Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry ⋮ List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times ⋮ A simulated multi-objective model for flexible job shop transportation scheduling ⋮ A tabu search approach for scheduling hazmat shipments ⋮ An integrated search heuristic for large-scale flexible job shop scheduling problems ⋮ Path-relinking tabu search for the multi-objective flexible job shop scheduling problem ⋮ Genetic tabu search for the fuzzy flexible job shop problem ⋮ Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ An effective architecture for learning and evolving flexible job-shop schedules ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ A modified biogeography-based optimization for the flexible job shop scheduling problem ⋮ Pareto-ranking based quantum-behaved particle swarm optimization for multiobjective optimization ⋮ Metaheuristics: A bibliography ⋮ Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem ⋮ A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times ⋮ A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem ⋮ A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem ⋮ An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem ⋮ A multi-agent system for integrated scheduling and maintenance planning of the flexible job shop ⋮ A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time ⋮ Novel model and solution method for flexible job shop scheduling problem with batch processing machines ⋮ Flexible job-shop scheduling with transportation resources ⋮ An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints ⋮ Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem ⋮ A decomposition-based artificial bee colony algorithm for the multi-objective flexible jobshop scheduling problem ⋮ Multi-objective fuzzy flexible job shop scheduling using memetic algorithm ⋮ Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem ⋮ Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems ⋮ A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem ⋮ Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem ⋮ Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times ⋮ Decomposition techniques with mixed integer programming and heuristics for home healthcare planning ⋮ Adaptive multimeme algorithm for flexible job shop scheduling problem ⋮ Simulated-annealing-based hyper-heuristic for flexible job-shop scheduling ⋮ Spatial-domain fitness landscape analysis for combinatorial optimization ⋮ Job-shop scheduling with processing alternatives. ⋮ A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. ⋮ An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems ⋮ A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems ⋮ A MILP model for an extended version of the flexible job shop problem ⋮ An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem ⋮ Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises ⋮ Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling ⋮ An enhanced genetic algorithm with an innovative encoding strategy for flexible job-shop scheduling with operation and processing flexibility ⋮ A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities ⋮ A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem ⋮ A new energy-aware flexible job shop scheduling method using modified biogeography-based optimization ⋮ A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems ⋮ The job shop scheduling problem with convex costs ⋮ A genetic algorithm for the flexible job-shop scheduling problem ⋮ Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net ⋮ An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria ⋮ Flexible job shop scheduling with overlapping in operations ⋮ A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling ⋮ Continuous flow models for batch manufacturing: a basis for a hierarchical approach ⋮ Scenario-based learning for stochastic combinatorial optimisation ⋮ A heuristic to schedule flexible job-shop in a glass factory ⋮ A Petri net based algorithm for minimizing total tardiness in flexible manufacturing systems ⋮ Scheduling job shop associated with multiple routings with genetic and ant colony heuristics ⋮ Mathematical models for job-shop scheduling problems with routing and process plan flexibility ⋮ Discrepancy search for the flexible job shop scheduling problem ⋮ Analysis of the similarities and differences of job-based scheduling problems ⋮ Metaheuristics for the online printing shop scheduling problem ⋮ Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm ⋮ Double layer ACO algorithm for the multi-objective FJSSP ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ A research survey: review of flexible job shop scheduling techniques ⋮ Parallel Tabu Search Algorithm with Uncertain Data for the Flexible Job Shop Problem ⋮ A new heuristic and an exact approach for a production planning problem ⋮ Exploiting process plan flexibility in production scheduling: A multi-objective approach ⋮ A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system ⋮ Flexible job-shop scheduling problem under resource constraints ⋮ An improved genetic algorithm for the distributed and flexible job-shop scheduling problem ⋮ Multi-resource shop scheduling with resource flexibility ⋮ Local search algorithms for the multiprocessor flow shop scheduling problem ⋮ Integrating preferences within multiobjective flexible job shop scheduling ⋮ Tabu search for the job-shop scheduling problem with multi-purpose machines ⋮ A multi-objective combinatorial model of casualty processing in major incident response

Uses Software

• Eiffel
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Analytic formulation of the principle of increasing precision with decreasing intelligence for intelligent machines
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Multi-level production scheduling for a class of flexible machining and assembly systems
• Modelling and scheduling of a flexible manufacturing system
• A new heuristic method for the flow shop sequencing problem
• Job shop scheduling with alternative machines
• Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• A Survey of Scheduling Rules
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Continuous flow models for batch manufacturing: a basis for a hierarchical approach
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

This page was built for publication: Routing and scheduling in a flexible job shop by tabu search