An effective hybrid optimization strategy for job-shop scheduling problems
From MaRDI portal
Publication:5936137
DOI10.1016/S0305-0548(99)00137-9zbMath1017.90048OpenAlexW1984543024MaRDI QIDQ5936137
Publication date: 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00137-9
simulated annealinggenetic algorithmbenchmark job-shop scheduling problemshybrid optimization strategy
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (29)
Enhanced ant colony optimization for multiscale problems ⋮ Hybrid simulated annealing with memory: an evolution-based diversification approach ⋮ A hybrid heuristic to solve the parallel machines job-shop scheduling problem ⋮ AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS ⋮ Scheduling a single vehicle in the just-in-time part supply for a mixed-model assembly line ⋮ A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling ⋮ Hybrid approach for buffer allocation in open serial production lines ⋮ An effective new island model genetic algorithm for job shop scheduling problem ⋮ Solving a concrete sleepers production scheduling by genetic algorithms ⋮ A novel improved chef-based optimization algorithm with Gaussian random walk-based diffusion process for global optimization and engineering problems ⋮ An agent-based parallel approach for the job shop scheduling problem with genetic algorithms ⋮ Multiple colony ant algorithm for job-shop scheduling problem ⋮ Approximative procedures for no-wait job shop scheduling. ⋮ Ant colony optimization combined with taboo search for the job shop scheduling problem ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net ⋮ A new hybrid genetic algorithm for job shop scheduling problem ⋮ A hybrid genetic algorithm for the job shop scheduling problem ⋮ Stochastic optimization using simulated annealing with hypothesis test ⋮ Hybrid genetic algorithm based on quantum computing for numerical optimization and parameter estimation ⋮ An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach ⋮ On the optimization of multitasking process with multiplayer ⋮ Improved immune algorithm for global numerical optimization and job-shop scheduling problems ⋮ An effective hybrid PSOSA strategy for optimization and its application to parameter estimation ⋮ Genetic algorithms and simulated annealing for scheduling in agile manufacturing ⋮ Hybrid rollout approaches for the job shop scheduling problem ⋮ Two effective hybrid metaheuristic algorithms for minimization of multimodal functions ⋮ Optimal reduction of models using a hybrid searching strategy ⋮ Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A survey of priority rule-based scheduling
- Genetic algorithms and very fast simulated reannealing: A comparison
- Simple genetic algorithm with local tuning: Efficient global optimizing technique
- Linear analysis of genetic algorithms
- A genetic algorithm for the job shop problem
- Evolution based learning in a job shop scheduling environment
- Deterministic job-shop scheduling: Past, present and future
- Applying tabu search to the job-shop scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Cooling Schedules for Optimal Annealing
- Job Shop Scheduling by Simulated Annealing
- Job-Shop Scheduling by Implicit Enumeration
- The Complexity of Flowshop and Jobshop Scheduling
This page was built for publication: An effective hybrid optimization strategy for job-shop scheduling problems
