On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane
Henry LinFrans SchalekampPublished in: CoRR (2012)
Keyphrases
- scheduling problem
- euclidean plane
- np hard
- single machine
- flowshop
- computational complexity
- tabu search
- data sets
- neural network
- minimizing makespan
- processing times
- minimum cost
- complexity analysis
- space complexity
- earliness tardiness
- square error
- sequence dependent setup times
- setup times
- lower bound
- real time
- information systems
- cost function