A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
DOI10.1016/J.COR.2016.10.003zbMATH Open1391.90327OpenAlexW2527918309MaRDI QIDQ1652147FDOQ1652147
Authors: Xianpeng Wang, Lixin Tang 
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.10.003
Recommendations
- A new neighborhood based Memetic algorithm for permutation flowshop scheduling problem
- A multi-objective memetic algorithm for the job-shop scheduling problem
- scientific article; zbMATH DE number 6746310
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
- A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
Learning and adaptive systems in artificial intelligence (68T05) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- A dynamic clustering based differential evolution algorithm for global optimization
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- Genetic local search for multi-objective flowshop scheduling problems
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
- Self-adaptive learning based particle swarm optimization
- A multi-objective particle swarm for a flow shop scheduling problem
- Adaptive evolutionary programming based on reinforcement learning
- A data mining approach to evolutionary optimisation of noisy multi-objective problems
Cited In (10)
- A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time
- MOEA/DEP: an algebraic decomposition-based evolutionary algorithm for the multiobjective permutation flowshop scheduling problem
- Title not available (Why is that?)
- A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Pattern mining‐based pruning strategies in stochastic local searches for scheduling problems
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
- An improved discrete artificial bee colony algorithm for flexible flowshop scheduling with step deteriorating jobs and sequence-dependent setup times
- A multi-objective memetic algorithm for the job-shop scheduling problem
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
Uses Software
This page was built for publication: A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652147)
