A Computational Study of Local Search Algorithms for Job Shop Scheduling
From MaRDI portal
Publication:4302714
DOI10.1287/ijoc.6.2.118zbMath0819.90040OpenAlexW2124865991MaRDI QIDQ4302714
N. L. J. Ulder, Jan Karel Lenstra, Peter J. M. Van Laarhoven, Emile H. L. Aarts
Publication date: 4 October 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.118
simulated annealingjob shop schedulingthreshold acceptinggenetic local searchlocal search algorithmscomputational performance analysis
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A novel threshold accepting meta-heuristic for the job-shop scheduling problem, Unrelated parallel machine scheduling using local search, Evolution based learning in a job shop scheduling environment, A generalized permutation approach to job shop scheduling with genetic algorithms, Look ahead job demanding for improving job shop performance, Improving local search heuristics for some scheduling problems. I, A comparison of local search methods for flow shop scheduling, Metaheuristics: A bibliography, Designing and reporting on computational experiments with heuristic methods, A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems, Job-shop scheduling: Computational study of local search and large-step optimization methods, An experimental analysis of local minima to improve neighbourhood search., Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\), An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments, A hybrid genetic algorithm for the job shop scheduling problem, Production Control of a Flexible Manufacturing System in a Job Shop Environment, Human-guided search, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, A genetic algorithm methodology for complex scheduling problems, Improving local search heuristics for some scheduling problems. II, Two simulated annealing-based heuristics for the job shop scheduling problem, Some new results on simulated annealing applied to the job shop scheduling problem, Job shop scheduling with beam search, Deterministic job-shop scheduling: Past, present and future, Hybrid rollout approaches for the job shop scheduling problem, Genetic algorithms and traveling salesman problems, The job shop scheduling problem: Conventional and new solution techniques, General local search methods, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, Convergence of Simulated Annealing with Feedback Temperature Schedules, Simulated annealing and genetic algorithms for scheduling products with multi-level product structure, 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, Reduction of job-shop problems to flow-shop problems with precedence constraints, Benchmarks for shop scheduling problems, Simulated annealing for resource-constrained scheduling, Maintaining longest paths incrementally
