Local search metaheuristics for some discrete-continuous project scheduling problems with discounted cash flows.
Marek MikaRafal RózyckiGrzegorz WaligóraPublished in: MMAR (2011)
Keyphrases
- scheduling problem
- tabu search
- job shop scheduling problem
- simulated annealing
- metaheuristic
- discrete space
- genetic algorithm
- job shop
- path relinking
- combinatorial optimization
- continuous domains
- iterated local search
- continuous data
- multi start
- continuous action
- flowshop
- job shop scheduling
- continuous variables
- continuous space
- memetic algorithm
- search procedure
- single machine
- markov decision processes
- np hard
- search algorithm
- discrete variables
- continuous functions
- processing times
- discrete data
- optimization problems
- scatter search
- case study
- optimal solution
- project management
- search space
- greedy heuristics
- software development
- particle swarm optimization
- infinite horizon
- vehicle routing problem
- guided local search
- sequencing problems
- quay crane
- greedy randomized adaptive search procedure
- continuous optimization
- variable neighborhood search
- parallel machines
- finite number
- solution space
- evolutionary algorithm