Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
From MaRDI portal
Publication:4302712
DOI10.1287/ijoc.6.2.108zbMath0807.90066OpenAlexW2139910732MaRDI QIDQ4302712
Publication date: 21 August 1994
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.6.2.108
Large-scale problems in mathematical programming (90C06) Deterministic scheduling theory in operations research (90B35) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
An improved shifting bottleneck procedure for the job shop scheduling problem, Benchmarks for basic scheduling problems, Routing and scheduling in a flexible job shop by tabu search, Adaptive temperature control for simulated annealing: a comparative study, Unrelated parallel machine scheduling using local search, Job-shop local-search move evaluation without direct consideration of the criterion's value, A hybrid evolutionary algorithm to solve the job shop scheduling problem, A very fast TS/SA algorithm for the job shop scheduling problem, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, 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, A hybrid metaheuristic algorithm to optimise a real-world robotic cell, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, Solving the job-shop scheduling problem optimally by dynamic programming, A neighborhood for complex job shop scheduling problems with regular objectives, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, Focused simulated annealing search: An application to job shop scheduling, Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements, A comparison of local search methods for flow shop scheduling, Metaheuristics: A bibliography, Parallel local search, Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling, Two-machine flow shop problems with a single server, A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, Instance space analysis and algorithm selection for the job shop scheduling problem, A hierarchical approach for the FMS scheduling problem, Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems, A general approach for optimizing regular criteria in the job-shop scheduling problem, Heuristics from Nature for Hard Combinatorial Optimization Problems, Ant colony optimization combined with taboo search for the job shop scheduling problem, An advanced tabu search algorithm for the job shop problem, A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem, Proactive release procedures for just-in-time job shop environments, subject to machine failures, An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times, A hybrid genetic algorithm for the job shop scheduling problem, A comparison of problem decomposition techniques for the FAP, 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 genetic algorithm methodology for complex scheduling problems, Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs, Adaptive memory programming: a unified view of metaheuristics, Fast parallel heuristics for the job shop scheduling problem, An integrated approach for modeling and solving the scheduling problem of container handling systems, Deterministic job-shop scheduling: Past, present and future, Hybrid rollout approaches for the job shop scheduling problem, The job shop scheduling problem: Conventional and new solution techniques, A new hybrid parallel genetic algorithm for the job‐shop scheduling problem, The life span method -- a new variant of local search, 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, Decomposition methods for reentrant flow shops with sequence-dependent setup times, Benchmarks for shop scheduling problems, Applying machine based decomposition in 2-machine flow shops, Job-shop scheduling with blocking and no-wait constraints, Decomposition methods for large job shops, A novel chaotic search for quadratic assignment problems, Combining prospect theory with fuzzy theory to handle disruption in production scheduling, Problem difficulty for tabu search in job-shop scheduling, A tabu search approach to machine scheduling
