A heuristic-genetic algorithm for client web service scheduling constrained by one I/O port.
Waralak ChongdarakulPublished in: ISPACS (2016)
Keyphrases
- genetic algorithm
- web services
- job shop scheduling problem
- tabu search
- genetic algorithm to solve
- scheduling problem
- simulated annealing
- container terminal
- list scheduling
- iterative repair
- input output
- rolling horizon
- unrelated parallel machines
- client server
- job shop
- parallel genetic algorithm
- fitness function
- scheduling jobs
- parallel machines
- optimal solution
- produce high quality solutions
- neural network
- squeaky wheel
- memetic algorithm
- combinatorial optimization
- dynamic programming
- multi objective
- round robin
- multidimensional knapsack problem
- file system
- single machine
- search algorithm
- scheduling policies
- hard constraints
- main memory
- np hard