On the Complexity of Scheduling Problems for Parallel/Pipelined Machines.
David BernsteinMichael RodehIzidor GertnerPublished in: IEEE Trans. Computers (1989)
Keyphrases
- scheduling problem
- identical machines
- parallel machines
- flowshop
- single machine
- processing times
- np hard
- computational complexity
- worst case
- decision problems
- earliness tardiness
- neural network
- setup times
- job shop scheduling problem
- tabu search
- parallel implementation
- massively parallel
- learning machines
- parallel architecture
- shared memory
- sequence dependent setup times
- space complexity
- identical parallel machines
- parallel machine scheduling problem