Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time.

M. K. Marichelvam Ömür Tosun M. Geetha

Published in: Appl. Soft Comput. (2017)

Keyphrases

search algorithm
scheduling problem
lower bound
processing times
search space
heuristic search
branch and bound
hybrid approaches
single machine
computer vision
search tree
flow field
data sets
search methods
case study
search procedure
visual cortex
batch processing