On the Computational Complexity of a Generalized Scheduling Problem.
K. VairavanRichard A. DeMilloPublished in: IEEE Trans. Computers (1976)
Keyphrases
- scheduling problem
- computational complexity
- np hard
- single machine
- tabu search
- flowshop
- special case
- high computational complexity
- processing times
- np complete
- memory requirements
- earliness tardiness
- low complexity
- computational efficiency
- decision problems
- neural network
- approximation algorithms
- computationally efficient
- parallel machines
- release dates
- sequence dependent setup times
- total tardiness
- multiscale
- job shop scheduling problem
- case study
- precedence constraints
- setup times
- data mining