Some efficient solutions to the affine scheduling problem. I. One-dimensional time.
Paul FeautrierPublished in: Int. J. Parallel Program. (1992)
Keyphrases
- efficient solutions
- scheduling problem
- tabu search
- bi objective
- bicriteria
- heuristic methods
- single machine
- flowshop
- setup times
- processing times
- np hard
- affine transformation
- affine invariant
- multi dimensional
- optimal solution
- parallel machines
- image registration
- minimizing makespan
- precedence constraints
- permutation flowshop
- piecewise affine
- pareto optimal solutions
- cost function
- search space