Minimising the makespan in open shop scheduling problems using variants of discrete firefly algorithm.
A. Hussain LalVishnu K. R.A. Noorul HaqPublished in: Int. J. Adv. Oper. Manag. (2019)
Keyphrases
- open shop
- job shop
- scheduling problem
- firefly algorithm
- flowshop
- job shop scheduling
- parallel machines
- convergence speed
- single machine
- job shop scheduling problem
- completion times
- tabu search
- unrelated parallel machines
- production scheduling
- filter design
- resource constrained
- np hard
- processing times
- approximation algorithms
- metaheuristic
- precedence constraints
- setup times
- memetic algorithm
- combinatorial optimization problems
- optimization problems
- differential evolution
- ant colony optimization