A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times.
Vitaly A. StrusevichPublished in: Discret. Appl. Math. (1999)
Keyphrases
- optimal solution
- search algorithm
- dynamic programming
- parallel machine scheduling problem
- greedy heuristic
- search strategies
- operational decisions
- unrelated parallel machines
- strongly np hard
- transportation systems
- depth first search
- beam search
- heuristic methods
- database
- linear programming
- scheduling problem
- lower bound
- decision making
- neural network