A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem.
Fantahun M. DefershaPublished in: Int. Trans. Oper. Res. (2015)
Keyphrases
- scheduling problem
- flowshop
- parallel computation
- tabu search
- simulated annealing
- minimizing makespan
- single machine
- minimizing total tardiness
- processing times
- search procedure
- np hard
- permutation flowshop
- job shop scheduling problem
- setup times
- total flowtime
- bicriteria
- sequence dependent setup times
- parallel algorithm
- precedence constraints
- total tardiness
- flowshop scheduling
- genetic algorithm
- parallel implementation
- search algorithm
- metaheuristic
- search space
- special case
- makespan minimization
- total weighted tardiness
- parallel machines
- real time
- maximum lateness
- strongly np hard
- preventive maintenance
- production scheduling
- distributed systems
- feasible solution
- parallel processing
- hybrid algorithm
- flowshop scheduling problems