Applying tabu search to the job-shop scheduling problem
From MaRDI portal
Publication:2367003
DOI10.1007/BF02023076zbMath0771.90056OpenAlexW1971338172WikidataQ59222321 ScholiaQ59222321MaRDI QIDQ2367003
Mauro Dell'Amico, Marco Trubian
Publication date: 16 August 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02023076
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
A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems, A multi-objective memetic algorithm for the job-shop scheduling problem, Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm, An improved shifting bottleneck procedure for the job shop scheduling problem, Hybrid simulated annealing with memory: an evolution-based diversification approach, Multi-agent based beam search for intelligent production planning and scheduling, Unrelated parallel machine scheduling using local search, A genetic algorithm for the job shop problem, Evolution based learning in a job shop scheduling environment, Genetic algorithms and tabu search: Hybrids for optimization, Job-shop local-search move evaluation without direct consideration of the criterion's value, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, Contraint-based combinators for local search, A very fast TS/SA algorithm for the job shop scheduling problem, Feasible insertions in job shop scheduling, short cycles and stable sets, A tabu search approach for scheduling hazmat shipments, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, Genetic tabu search for the fuzzy flexible job shop problem, Scatter search with path relinking for the job shop with time lags and setup times, A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective, Simplifying dispatching rules in genetic programming for dynamic job shop scheduling, Depth-first heuristic search for the job shop scheduling problem, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, On a scheduling problem in a robotized analytical system, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, A comparison of local search methods for flow shop scheduling, Metaheuristics: A bibliography, Integration of routing into a resource-constrained project scheduling problem, Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling, A tabu search algorithm for the open shop problem, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem, Job-shop scheduling: Computational study of local search and large-step optimization methods, A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective, Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, An alternative framework to Lagrangian relaxation approach for job shop scheduling., Job-shop scheduling with processing alternatives., A repairing technique for the local search of the job-shop problem., An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., Heuristics from Nature for Hard Combinatorial Optimization Problems, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm, An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment, FMS scheduling based on timed Petri net model and reactive graph search, Ant colony optimization combined with taboo search for the job shop scheduling problem, Efficient primal heuristic updates for the blocking job shop problem, Four decades of research on the open-shop scheduling problem to minimize the makespan, A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities, A prediction based iterative decomposition algorithm for scheduling large-scale job shops, METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM, Extended GRASP for the job shop scheduling problem with total weighted tardiness objective, Optimizing the system of virtual paths by tabu search., Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times, A tabu search algorithm for structural software testing, A new hybrid genetic algorithm for job shop scheduling problem, A competent memetic algorithm for complex scheduling, An effective hybrid optimization strategy for job-shop scheduling problems, A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling, Solving the aerial fleet refueling problem using group theoretic tabu search, Continuous flow models for batch manufacturing: a basis for a hierarchical approach, Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates, Minimizing L max for large-scale, job-shop scheduling problems, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, Nested partitions for the large-scale extended job shop scheduling problem, A genetic algorithm methodology for complex scheduling problems, Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?, Alternative graph formulation for solving complex factory-scheduling problems, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs, An integrated approach for modeling and solving the scheduling problem of container handling systems, Parallel and distributed local search in COMET, Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, Two simulated annealing-based heuristics for the job shop scheduling problem, Deterministic job-shop scheduling: Past, present and future, A lower bound for the job insertion problem., An SA/TS mixture algorithm for the scheduling tardiness problem, A simple tabu search method to solve the mixed-integer linear bilevel programming problem, The job shop scheduling problem: Conventional and new solution techniques, The life span method -- a new variant of local search, A fast tabu search algorithm for the permutation flow-shop problem, Heuristics for minimizing total weighted tardiness in flexible flow shops, Scheduling contractors' farm‐to‐farm crop harvesting operations, A hybrid genetic algorithm for the open shop scheduling problem, An integrated tabu search algorithm for the lot streaming problem in job shops, A large step random walk for minimizing total weighted tardiness in a job shop, Modelling and heuristics of FMS scheduling with multiple objectives, Efficiency of reductions of job-shop to flow-shop problems, Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects, Reduction of job-shop problems to flow-shop problems with precedence constraints, Job-shop scheduling with blocking and no-wait constraints, Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets, A tabu search algorithm for scheduling a single robot in a job-shop environment, Tabu search for the job-shop scheduling problem with multi-purpose machines, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, Handling flexibility in a ``generalised job shop with a fuzzy approach, A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows, Control abstractions for local search, Maintaining longest paths incrementally
Uses Software
Cites Work
- A branch and bound algorithm for the job-shop scheduling problem
- Semi-greedy heuristics: An empirical study
- Optimal two- and three-stage production schedules with setup times included
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- A Survey of Scheduling Rules
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
