Heuristic solving some discrete-continuous project scheduling problems with discounted cash flows.
Grzegorz WaligóraRafal RózyckiPublished in: MMAR (2016)
Keyphrases
- scheduling problem
- sequencing problems
- continuous domains
- tabu search
- discrete space
- list scheduling
- strongly np hard
- dynamic programming
- combinatorial optimization
- job shop scheduling problem
- continuous data
- finding an optimal solution
- graph coloring problems
- continuous variables
- quay crane
- discrete data
- case study
- continuous action
- continuous functions
- continuous space
- timetabling problem
- search heuristics
- flowshop
- markov decision processes
- simulated annealing
- np hard
- discrete variables
- mixed integer program
- continuous valued
- variable ordering
- beam search
- search algorithm for solving
- sliding tile
- setup times
- graph search
- infinite horizon
- processing times
- satisfiability problem
- knapsack problem
- branch and bound algorithm
- single machine
- optimal policy
- linear programming
- software development
- special case
- search algorithm
- optimal solution