A discrete inter-species cuckoo search for flowshop scheduling problems
From MaRDI portal
Publication:337568
DOI10.1016/j.cor.2015.01.005zbMath1348.90248OpenAlexW1973147618MaRDI QIDQ337568
Swagatam Das, Preetam Dasgupta
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
heuristicsmakespandiscrete inter-species cuckoo search (DISCS)hybrid flow-shop scheduling (HFS)mean flow timepermutation flow-shop scheduling problems (PESP)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Joint optimization of preventive maintenance and flexible flowshop sequence-dependent group scheduling considering multiple setups ⋮ A real-time order acceptance and scheduling approach for permutation flow shop problems ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Multiobjective cuckoo search for design optimization
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Some efficient heuristic methods for the flow shop sequencing problem
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- 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
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- 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
- 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
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Local search methods for the flowshop scheduling problem with flowtime minimization
- The hybrid flow shop scheduling problem
- A new heuristic for the n-job, M-machine flow-shop problem
- Benchmarks for basic scheduling problems
- Lévy flights, non-local search and simulated annealing
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
- Two-Stage, Hybrid Flowshop Scheduling Problem
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- On general routing problems
- An Evaluation of Flow Shop Sequencing Heuristics
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- The Complexity of Flowshop and Jobshop Scheduling
- 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
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: A discrete inter-species cuckoo search for flowshop scheduling problems
