Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion.
Hande ÖztopMehmet Fatih TasgetirenLevent KandillerQuan-Ke PanPublished in: Comput. Oper. Res. (2022)
Keyphrases
- flowshop
- scheduling problem
- learning mechanisms
- total flowtime
- makespan minimization
- tabu search
- permutation flowshop
- minimizing makespan
- processing times
- learning strategies
- learning mechanism
- flowshop scheduling problems
- single machine
- sequence dependent setup times
- cognitive architecture
- learning algorithm
- bicriteria
- setup times
- maximum lateness
- learning processes
- metaheuristic
- learning process
- flowshop scheduling
- special case
- domain knowledge
- total tardiness
- lot streaming
- strongly np hard
- total weighted tardiness
- np hard
- maximum tardiness
- minimizing total tardiness
- learning systems
- parallel machines
- unrelated parallel machines
- search algorithm
- job processing times
- release dates
- preventive maintenance
- job shop
- simulated annealing
- learning rules
- particle swarm optimization
- ant colony optimization
- precedence constraints
- dynamic programming
- active learning
- individual classifiers
- job shop scheduling problem
- optimization problems
- information processing
- combinatorial optimization
- neural network
- computational model