Lower-bound performance estimation for the high-level synthesis scheduling problem.
Minjoong RimRajiv JainPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1994)
Keyphrases
- lower bound
- scheduling problem
- high level synthesis
- np hard
- upper bound
- flowshop
- worst case
- single machine
- branch and bound algorithm
- processing times
- lower and upper bounds
- optimal solution
- minimizing makespan
- objective function
- setup times
- strongly np hard
- parallel architecture
- competitive ratio
- design space exploration
- parallel machines
- sufficiently accurate
- tabu search
- branch and bound
- graph cuts