A Fast Taboo Search Algorithm for the Job Shop Problem
From MaRDI portal
Publication:4363639
DOI10.1287/mnsc.42.6.797zbMath0880.90079OpenAlexW2006389447MaRDI QIDQ4363639
Czesław Smutnicki, Eugeniusz Nowicki
Publication date: 12 November 1997
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.42.6.797
Related Items
Hybrid simulated annealing with memory: an evolution-based diversification approach, Ant colony optimisation with parameterised search space for the job shop scheduling problem, Job-shop local-search move evaluation without direct consideration of the criterion's value, A hybrid heuristic to solve the parallel machines job-shop scheduling problem, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, A very fast TS/SA algorithm for the job shop scheduling problem, Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search, A neighborhood for complex job shop scheduling problems with regular objectives, A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem, Optimization of the integrated problem of employee timetabling and job shop scheduling, Hybrid Metaheuristics: An Introduction, Hybridizations of Metaheuristics With Branch & Bound Derivates, Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem, A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems, Energy cost efficient scheduling in flexible job-shop manufacturing systems, Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem, Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem, Multiple colony ant algorithm for job-shop scheduling problem, Heuristics from Nature for Hard Combinatorial Optimization Problems, A tabu search approach for proportionate multiprocessor open shop scheduling, A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem, An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment, An advanced tabu search algorithm for the job shop problem, Integrating operations research in constraint programming, A new approach to computing optimal schedules for the job-shop scheduling problem, Ejection chain and filter-and-fan methods in combinatorial optimization, A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem, Integrating operations research in constraint programming, Ejection chain and filter-and-fan methods in combinatorial optimization, A prediction based iterative decomposition algorithm for scheduling large-scale job shops, No-wait job shop scheduling: tabu search and complexity of subproblems, An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, An evolutionary approach to rehabilitation patient scheduling: A case study, A hybrid genetic algorithm for the job shop scheduling problem, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, Minimizing L max for large-scale, job-shop scheduling problems, Tabu search for a class of single-machine scheduling problems, An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, A genetic algorithm methodology for complex scheduling problems, Alternative graph formulation for solving complex factory-scheduling problems, Supercomputer Scheduling with Combined Evolutionary Techniques, The blocking job shop with rail-bound transportation, Similarities between meta-heuristics algorithms and the science of life, Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem, Cyclic flow shop scheduling problem with two-machine cells, A fine-grained parallel algorithm for the cyclic flexible job shop problem, Measures of subproblem criticality in decomposition algorithms for shop scheduling, A new hybrid parallel genetic algorithm for the job‐shop scheduling problem, An tentative taboo search algorithm for job shop scheduling, A flow-based tabu search algorithm for the RCPSP with transfer times, An improved shifting bottleneck procedure for the job shop scheduling problem, A novel threshold accepting meta-heuristic for the job-shop scheduling problem, A tabu search heuristic for the quay crane scheduling problem, Problems of discrete optimization: challenges and main approaches to solve them, Unrelated parallel machine scheduling using local search, A hybrid evolutionary algorithm to solve the job shop scheduling problem, Feasible insertions in job shop scheduling, short cycles and stable sets, Path-relinking tabu search for the multi-objective flexible job shop scheduling problem, A tabu search/path relinking algorithm to solve the job shop scheduling problem, Scatter search with path relinking for the job shop with time lags and setup times, Nondeterministic control for hybrid search, An effective architecture for learning and evolving flexible job-shop schedules, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, An effective heuristic algorithm for the partial shop scheduling problem, Solving the job-shop scheduling problem optimally by dynamic programming, Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints, A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective, An effective new island model genetic algorithm for job shop scheduling problem, Scheduling the truckload operations in automatic warehouses, An algorithm for the job shop scheduling problem based on global equilibrium search techniques, Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems, On a scheduling problem in a robotized analytical system, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, Tabu search for graph partitioning, A comparison of local search methods for flow shop scheduling, Metaheuristics: A bibliography, Integration of routing into a resource-constrained project scheduling problem, Minimizing total weighted tardiness in a generalized job shop, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem, Solving the serial batching problem in job shop manufacturing systems, Solving the flexible job shop scheduling problem with sequence-dependent setup times, A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective, A constraint-based local search backend for MiniZinc, An alternative framework to Lagrangian relaxation approach for job shop scheduling., Multipath adaptive tabu search for a vehicle control problem, A general approach for optimizing regular criteria in the job-shop scheduling problem, An agent-based parallel approach for the job shop scheduling problem with genetic algorithms, The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure., A repairing technique for the local search of the job-shop problem., A tabu search method guided by shifting bottleneck for the job shop scheduling problem, FMS scheduling based on timed Petri net model and reactive graph search, Effective neighbourhood functions for the flexible job shop problem, Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem, Flow shop batching and scheduling with sequence-dependent setup times, A branch and bound method for the job-shop problem with sequence-dependent setup times, Ant colony optimization combined with taboo search for the job shop scheduling problem, Family scheduling with batch availability in flow shops to minimize makespan, Efficient primal heuristic updates for the blocking job shop problem, A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities, Open shop cyclic scheduling, A new energy-aware flexible job shop scheduling method using modified biogeography-based optimization, Extended GRASP for the job shop scheduling problem with total weighted tardiness objective, The job shop scheduling problem with convex costs, A filter-and-fan approach to the job shop scheduling problem, Flow shop scheduling with heterogeneous workers, Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times, Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net, A competent memetic algorithm for complex scheduling, A new neighborhood and tabu search for the blocking job shop, Tabu search algorithms for job-shop problems with a single transport robot, Solving job shop scheduling problems utilizing the properties of backbone and ``big valley, Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming, The flexible blocking job shop with transfer and set-up times, Fast heuristics for minimizing the makespan in non-permutation flow shops, A new leader guided optimization for the flexible job shop problem, 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, Hybrid rollout approaches for the job shop scheduling problem, A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem, Constraint satisfaction problems: Algorithms and applications, A lower bound for the job insertion problem., A computational study of constraint satisfaction for multiple capacitated job shop scheduling, The job shop scheduling problem: Conventional and new solution techniques, General local search methods, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, A fast tabu search algorithm for the permutation flow-shop problem, Heuristics for minimizing total weighted tardiness in flexible flow shops, A two-machine permutation flow shop scheduling problem with buffers, 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, The nonpermutation flowshop scheduling problem: adjustment and bounding procedures, Job-shop scheduling with blocking and no-wait constraints, On not-first/not-last conditions in disjunctive scheduling, Decomposition methods for large job shops, 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, Problem difficulty for tabu search in job-shop scheduling, The flow shop with parallel machines: A tabu search approach, Tabu search for resource-constrained scheduling, A tabu search approach to machine scheduling, The permutation flow shop with buffers: A tabu search approach, Handling flexibility in a ``generalised job shop with a fuzzy approach, Control abstractions for local search, Maintaining longest paths incrementally
Uses Software
