A discrete inter-species cuckoo search for flowshop scheduling problems
From MaRDI portal
(Redirected from Publication:337568)
Recommendations
- A discrete cuckoo search algorithm for job-shop scheduling problem
- A hybrid discrete artificial bee colony algorithm for the permutation flow shop scheduling
- A hybrid discrete fruit fly optimization algorithm for solving permutation flow-shop scheduling problem
- Hybrid bat algorithm for flow shop scheduling problems
- A hybrid particle swarm optimization algorithm for the permutation flowshop scheduling problem
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A computational study of heuristics for two-stage flexible flowshops
- A discrete version of particle swarm optimization for flowshop scheduling problems
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- A new heuristic for the n-job, M-machine flow-shop problem
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- Algorithm AS 136: A K-Means Clustering Algorithm
- An Evaluation of Flow Shop Sequencing Heuristics
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
- Cooling down Lévy flights
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Lévy flights, non-local search and simulated annealing
- Makespan minimization on single batch-processing machine via ant colony optimization
- Multiobjective cuckoo search for design optimization
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
- On general routing problems
- Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach
- Some efficient heuristic methods for the flow shop sequencing problem
- The Complexity of Flowshop and Jobshop Scheduling
- The hybrid flow shop scheduling problem
- Two-Stage, Hybrid Flowshop Scheduling Problem
Cited in
(5)- Joint optimization of preventive maintenance and flexible flowshop sequence-dependent group scheduling considering multiple setups
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- A discrete cuckoo search algorithm for job-shop scheduling problem
- A real-time order acceptance and scheduling approach for permutation flow shop problems
This page was built for publication: A discrete inter-species cuckoo search for flowshop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337568)
