Job Shop Scheduling by Local Search
From MaRDI portal
Publication:5690267
DOI10.1287/ijoc.8.3.302zbMath0863.90094MaRDI QIDQ5690267
R. J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra
Publication date: 15 January 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/2416370c-f1ea-47d0-a86c-05780ecf192d
90B35: Deterministic scheduling theory in operations research
Related Items
Problem difficulty for tabu search in job-shop scheduling, Feasible insertions in job shop scheduling, short cycles and stable sets, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, A competitive and cooperative approach to propositional satisfiability, Scheduling the truckload operations in automatic warehouses, Minimizing total weighted tardiness in a generalized job shop, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, 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, A filter-and-fan approach to the job shop scheduling problem, Hybrid rollout approaches for the job shop scheduling problem, An integrated tabu search algorithm for the lot streaming problem in job shops, An improved genetic algorithm for the distributed and flexible job-shop scheduling problem, A computational study of constraint satisfaction for multiple capacitated job shop scheduling, Some thoughts on combinatorial optimisation, A hierarchical approach for the FMS scheduling problem, A local search template., A repairing technique for the local search of the job-shop problem., An experimental analysis of local minima to improve neighbourhood search., 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, Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing, The flow shop with parallel machines: A tabu search approach, Two simulated annealing-based heuristics for the job shop scheduling problem, Deterministic job-shop scheduling: Past, present and future, Constraint satisfaction problems: Algorithms and applications, A lower bound for the job insertion problem., Optimization of pitch sequencing for pneumatic tire by tabu search method, A knowledge-based evolutionary strategy for scheduling problems with bottlenecks, A novel threshold accepting meta-heuristic for the job-shop scheduling problem, Adaptive temperature control for simulated annealing: a comparative study, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Effective neighbourhood functions for the flexible job shop problem, Nested partitions for the large-scale extended job shop scheduling problem, An advanced tabu search algorithm for the job shop problem, Complexity of the job insertion problem in multi-stage scheduling, A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, 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, Neighborhood portfolio approach for local search applied to timetabling problems
Uses Software
