• Home
  • Search
  • A discrete whale optimization algorithm for the no-wait flow shop scheduling problem
  • Cite Icon10
  • https://doi.org/10.1177/00202940231180622Copy DOI Icon

A discrete whale optimization algorithm for the no-wait flow shop scheduling problem

Show More
  • Abstract
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A discrete whale optimization algorithm (DWOA) is presented to solve the no-wait flow shop scheduling problem (NWFSSP) with the optimization objective makespan. An effective combination of nearest neighbor (NN) and standard deviation heuristics (SDH) is used to acquire initial solutions of the population. After that, three crossover operators, the two-point crossover (TPX), multiple-point crossover (MPX) and job-based crossover (JBX) operators, are designed to mimics the humpback whales hunting process. Moreover, the dynamic transform mechanism of search process is designed to better balance the exploration and exploitation ability of DWOA. In order to further improve the optimization effect of DWOA, the parallel neighborhood search (PNS) and the serial neighborhood search (SNS) are selected to execute the local search and promoting global search scheme, respectively. Finally, to test the performance of DWOA, extensive experiments are conducted on benchmarks designed by Reeves and Taillard, which contain parameters tuning, effectiveness of the improvement strategies in the DWOA and comparison with several existing algorithms. From the experimental results, it is validated that the effectiveness of the improved mechanisms and the performance of the DWOA which can find better makespan values compared with other algorithms for solving NWFSSP.

Loading PDF

Similar Papers
  • Conference Article

A building block inspired algorithm with variable neighborhood search for no-wait flow shop scheduling problems

  • Oct 24, 2022
  • Donglin Ma +2
  • PDF
  • Research Article
  • Citations7

A Chance Constrained Programming Approach for No-Wait Flow Shop Scheduling Problem under the Interval-Valued Fuzzy Processing Time

  • Apr 30, 2021
  • Processes
  • Hao Sun +4
  • Book Chapter
  • Citations17

The Mixing Rate of Different Crossover Operators

  • Jan 01, 2001
  • Foundations of Genetic Algorithms 2001 (FOGA 6)
  • Adam Prügel-Bennetf
  • Conference Article

An adaptive genetic algorithm based on the structure of the chain agent

  • Dec 01, 2014
  • Yunyun Bei +1
  • Book Chapter
  • Citations5

An Evolutionary Approach for the TSP and the TSP with Backhauls

  • Jan 01, 2010
  • Haldun Süral +3
  • Conference Article
  • Citations36

A comparison on the performance of crossover techniques in video game

  • Nov 01, 2013
  • Gan Kim Soon +4
  • Research Article
  • Citations19

Adaptive discrete cat swarm optimisation algorithm for the flexible job shop problem

  • Jan 01, 2019
  • International Journal of Bio-Inspired Computation
  • Tian Hua Jiang +1
  • Research Article
  • Citations129

An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem

  • Oct 27, 2009
  • Applied Mathematics and Computation
  • M Fatih Tasgetiren +2
  • Research Article
  • Citations38

A new hybrid ant colony algorithm for scheduling of no-wait flowshop

  • Jul 04, 2016
  • Operational Research
  • Vahid Riahi +1
  • Research Article

Testing Performance (Time Analysis) of Nearest Neighbour (NN) Search Algorithms on K-d Trees

  • Oct 07, 2021
  • International Journal of Advanced Trends in Computer Science and Engineering
  • Mihir Goyenka +4
  • Conference Article
  • Citations4

Discrete Fruit Fly Optimization Algorithm for Disassembly Line Balancing Problems by Considering Human Worker’s Learning Effect

  • Nov 24, 2022
  • Jianping Wang +5
  • PDF
  • Research Article
  • Citations2

Data Collection Method of Large Scale WSNS Mobile Node Based on Compressed Sensing and Intelligent Optimization

  • Apr 01, 2020
  • Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University
  • Zhouzhou Liu +3
  • Book Chapter
  • Citations1

Flexible Job Shop Scheduling Problem by Chemical-Reaction Optimization Algorithm

  • Jan 01, 2011
  • Junqing Li +5
  • Book Chapter
  • Citations9

Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions

  • Jan 01, 2020
  • Josh Alman +2
  • Research Article
  • Citations69

An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems

  • Dec 19, 2015
  • Journal of Intelligent Manufacturing
  • Hong-Yan Sang +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.