On the weak computability of a four dimensional orthogonal packing and time scheduling problem.
Wenqi HuangKun HePublished in: Theor. Comput. Sci. (2013)
Keyphrases
- scheduling problem
- flowshop
- single machine
- np hard
- processing times
- minimizing makespan
- tabu search
- permutation flowshop
- setup times
- total tardiness
- packing problem
- limited capacity
- precedence constraints
- neural network
- real time
- job shop scheduling problem
- parallel machines
- special case
- release dates
- multiscale
- information systems
- social networks
- earliness tardiness