A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability.
Teresa NetoMiguel ConstantinoIsabel MartinsJoão Pedro PedrosoPublished in: Int. Trans. Oper. Res. (2013)
Keyphrases
- branch and bound procedure
- scheduling problem
- branch and bound
- single machine
- processing times
- tabu search
- neural network
- sequencing problems
- np hard
- search algorithm
- artificial intelligence
- flowshop
- precedence constraints
- job shop scheduling
- setup times
- genetic algorithm
- upper bound
- learning algorithm
- graph search
- limited capacity
- data sets
- earliness tardiness