A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system.
Michal TzurEhud DreznerPublished in: Eur. J. Oper. Res. (2011)
Keyphrases
- scheduling problem
- tabu search
- list scheduling
- job shop scheduling problem
- unrelated parallel machines
- single machine
- setup times
- flowshop
- optimal scheduling
- strongly np hard
- dynamic programming
- np hard
- randomly generated test problems
- quay crane
- simulated annealing
- multi depot
- minimizing makespan
- processing times
- optimal solution
- precedence constraints
- permutation flowshop
- parallel machines
- greedy search
- maximum lateness
- partitioning algorithm
- spatial distribution
- integer programming
- combinatorial optimization
- random variables
- state space
- search algorithm