Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
From MaRDI portal
Publication:964844
DOI10.1007/s10732-008-9094-yzbMath1184.90064OpenAlexW2030422516WikidataQ57587882 ScholiaQ57587882MaRDI QIDQ964844
Miguel A. González, Ramiro Varela, Camino R. Vela
Publication date: 21 April 2010
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-008-9094-y
Related Items (11)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Genetic tabu search for the fuzzy flexible job shop problem ⋮ Scatter search with path relinking for the job shop with time lags and setup times ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ An integrated dynamic facility layout and job shop scheduling problem: a hybrid NSGA-II and local search algorithm ⋮ A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm ⋮ A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty ⋮ Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis ⋮ A competent memetic algorithm for complex scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
- Job shop scheduling with setup times, deadlines and precedence constraints
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- Extending the shifting bottleneck procedure to real-life applications
- A branch and bound algorithm for the job-shop scheduling problem
- Adjustment of heads and tails for the job-shop problem
- Job shop scheduling with separable sequence-dependent setups
- Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times
- An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
- A generalized permutation approach to job shop scheduling with genetic algorithms
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- Applying tabu search to the job-shop scheduling problem
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- A computational study of shifting bottleneck procedures for shop scheduling problems
- A hybrid genetic algorithm for the single machine scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- A genetic algorithm based procedure for more realistic job shop scheduling problems
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Impact of sequence-dependent setup time on job shop scheduling performance
- Algorithms for Solving Production-Scheduling Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
This page was built for publication: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
