Hybrid Algorithm for Multiprocessor Scheduling with Makespan Minimization and Constraint on Interprocessor Data Exchange.
Vasily V. BalashovValery A. KostenkoIlya A. FedorenkoIlya P. SavitskyChumin SunJiexing GaoLi ZhouJie SunPublished in: CoDIT (2023)
Keyphrases
- hybrid algorithm
- data exchange
- makespan minimization
- metaheuristic
- tabu search
- job shop scheduling problem
- simulated annealing
- scheduling problem
- ant colony optimization
- query answering
- particle swarm optimization
- data integration
- special case
- processing times
- flowshop
- parallel machines
- optimal solution
- schema mappings
- genetic algorithm
- data management
- polynomially solvable
- particle swarm optimization pso
- differential evolution
- single machine
- optimization method
- polynomial time approximation
- feasible solution
- hybrid method
- memetic algorithm
- np complete
- np hard
- optimization problems
- evolutionary algorithm
- combinatorial optimization problems
- combinatorial optimization
- search space
- vehicle routing problem
- data mining
- xml schema
- branch and bound
- database systems
- data model
- neural network