Job Shop Scheduling by Local Search
From MaRDI portal
Recommendations
Cited in
(72)- 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
- A search space analysis of the job shop scheduling problem
- Some thoughts on combinatorial optimisation
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- 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
- The job shop scheduling problem with convex costs
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Job shop scheduling with beam search
- 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
- Efficient local search algorithms for job-shop scheduling problems
- 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
- Job-shop local-search move evaluation without direct consideration of the criterion's value
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Guided local search with shifting bottleneck for job shop scheduling
- Combining constraint programming and local search for job-shop scheduling
- Fast local search for fuzzy job shop scheduling
- A random neighborhood swapping algorithm for job shop scheduling problems
- Multi-objectivization via decomposition: an analysis of helper-objectives and complete decomposition
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- scientific article; zbMATH DE number 1031416 (Why is no real title available?)
- scientific article; zbMATH DE number 1054937 (Why is no real title available?)
- scientific article; zbMATH DE number 2079761 (Why is no real title available?)
- A new approach to computing optimal schedules for the job-shop scheduling problem
- A CONNECTIONIST METHOD TO SOLVE JOB SHOP PROBLEMS
- A machine-order search space for job-shop scheduling problems
- Advanced search techniques for the job shop problem : a comparison
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- Firefly-Inspired Algorithm for Job Shop Scheduling
- A time-indexed LP-based approach for min-sum job-shop problems
- Local adjustments: A general algorithm
- Analysis of the similarities and differences of job-based scheduling problems
- 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
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- 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
This page was built for publication: Job Shop Scheduling by Local Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690267)
