A hybrid evolutionary algorithm to solve the job shop scheduling problem
From MaRDI portal
Publication:324301
DOI10.1007/S10479-013-1332-5zbMATH Open1350.90018OpenAlexW2000721451MaRDI QIDQ324301FDOQ324301
Authors: Bo Peng, Zhipeng Lü, T. C. Edwin Cheng 
Publication date: 11 October 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1332-5
Recommendations
- A hybrid evolutionary algorithm for the job shop scheduling problem
- A hybrid evolutionary algorithm for bi-objective job shop scheduling problems
- A hybrid genetic algorithm for the job shop scheduling problem
- Heuristic genetic algorithm for job shop scheduling problem
- Evolutionary algorithms for jobshop scheduling
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- A new hybrid genetic algorithm for job shop scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The Complexity of Flowshop and Jobshop Scheduling
- Job Shop Scheduling by Simulated Annealing
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Guided local search with shifting bottleneck for job shop scheduling
- A genetic algorithm for the flexible job-shop scheduling problem
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A genetic algorithm for the job shop problem
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Some new results on simulated annealing applied to the job shop scheduling problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A time-indexed LP-based approach for min-sum job-shop problems
- Solving an integrated job-shop problem with human resource constraints
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Cited In (19)
- Evolutionary Computation in Combinatorial Optimization
- JOB SEQUENCING IN AN EVOLUTIONARY PARADIGM
- A hybrid evolutionary algorithm for the job shop scheduling problem
- Title not available (Why is that?)
- Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
- A synergy exploiting evolutionary approach to complex scheduling problems
- A hybrid evolutionary algorithm for bi-objective job shop scheduling problems
- A new hybrid genetic algorithm for job shop scheduling problem
- Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem
- A survey of job shop scheduling problem: the types and models
- Novel model and solution method for flexible job shop scheduling problem with batch processing machines
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- Evolutionary algorithms for supply chain management
- Title not available (Why is that?)
- Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times
- Hybrid evolutionary -- tabu search algorithm for scheduling multiple-variant tasks
- Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking
Uses Software
This page was built for publication: A hybrid evolutionary algorithm to solve the job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324301)
