Flowshop NEH-Based Heuristic Recommendation.
Lucas Marcondes PavelskiMarie-Eléonore KessaciMyriam Regattieri DelgadoPublished in: EvoCOP (2021)
Keyphrases
- flowshop
- scheduling problem
- permutation flowshop
- strongly np hard
- maximum tardiness
- tabu search
- minimizing makespan
- bicriteria
- flowshop scheduling
- flowshop scheduling problems
- special case
- processing times
- sequence dependent setup times
- setup times
- maximum lateness
- single machine
- number of tardy jobs
- branch and bound algorithm
- total tardiness
- job shop scheduling problem
- np hard
- single machine scheduling problem
- optimal solution
- minimizing total tardiness
- recommender systems
- simulated annealing
- dynamic programming
- preventive maintenance
- integer linear programming
- memetic algorithm
- lower bound
- search algorithm
- identical parallel machines
- lagrangian relaxation
- lot streaming
- robotic cell
- release dates
- precedence constraints
- neural network
- parallel machines
- feasible solution
- combinatorial optimization
- multistage
- objective function