Metaheuristics for some discrete-continuous project scheduling problems to maximize the net present value.
Grzegorz WaligóraPublished in: MMAR (2017)
Keyphrases
- scheduling problem
- tabu search
- discrete space
- continuous domains
- continuous data
- makespan minimization
- discrete data
- continuous action
- discrete variables
- continuous variables
- continuous space
- metaheuristic
- processing times
- project management
- setup times
- flowshop
- simulated annealing
- single machine
- path relinking
- job shop scheduling problem
- np hard
- piecewise linear
- discrete geometry
- continuous state spaces
- greedy heuristics
- job shop scheduling
- continuous functions
- neural network
- particle swarm optimization
- software development
- optimization problems
- case study
- genetic algorithm
- precedence constraints
- finite number
- combinatorial optimization
- ant colony optimization
- information systems
- sequencing problems