Nash equilibrium inspired greedy search for solving flow shop scheduling problems.
Jabrane BelabidSaid AqilKaram AllaliPublished in: Appl. Intell. (2023)
Keyphrases
- scheduling problem
- nash equilibrium
- flowshop
- greedy search
- game theory
- single machine
- tabu search
- strongly np hard
- special case
- processing times
- np hard
- job shop scheduling
- sequence dependent setup times
- setup times
- metaheuristic
- search space
- precedence constraints
- mixed strategy
- decision trees
- beam search
- nash equilibria
- simulated annealing
- job shop
- maximum lateness
- parallel machines
- search algorithm
- combinatorial optimization
- heuristic search
- worst case
- release dates
- hill climbing
- machine learning
- learning algorithm
- job shop scheduling problem
- global search
- computational efficiency