A discrete inter-species cuckoo search for flowshop scheduling problems
From MaRDI portal
Publication:337568
DOI10.1016/J.COR.2015.01.005zbMATH Open1348.90248OpenAlexW1973147618MaRDI QIDQ337568FDOQ337568
Authors: Preetam Dasgupta, Swagatam Das 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.01.005
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
heuristicsmakespandiscrete inter-species cuckoo search (DISCS)hybrid flow-shop scheduling (HFS)mean flow timepermutation flow-shop scheduling problems (PESP)
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Algorithm AS 136: A K-Means Clustering Algorithm
- The hybrid flow shop scheduling problem
- Title not available (Why is that?)
- The Complexity of Flowshop and Jobshop Scheduling
- Two-Stage, Hybrid Flowshop Scheduling Problem
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Makespan minimization on single batch-processing machine via ant colony optimization
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A new heuristic for the n-job, M-machine flow-shop problem
- Benchmarks for basic scheduling problems
- Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- On general routing problems
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Some efficient heuristic methods for the flow shop sequencing problem
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- An Evaluation of Flow Shop Sequencing Heuristics
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- Multiobjective cuckoo search for design optimization
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Lévy flights, non-local search and simulated annealing
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- A computational study of heuristics for two-stage flexible flowshops
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach
- Cooling down Lévy flights
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
Cited In (5)
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- Joint optimization of preventive maintenance and flexible flowshop sequence-dependent group scheduling considering multiple setups
- A discrete cuckoo search algorithm for 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
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
Uses Software
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)
