Extended 0/1 LP formulation for the scheduling problem in high-level synthesis.
Hans AchatzPublished in: EURO-DAC (1993)
Keyphrases
- scheduling problem
- high level synthesis
- np hard
- linear programming
- tabu search
- asset liability management
- lp relaxation
- single machine
- minimizing makespan
- setup times
- flowshop
- linear program
- optimal solution
- feasible solution
- parallel machines
- mixed integer
- computer science
- lp norm
- computer vision
- processing times
- integer program
- parallel architecture
- quadratic program
- permutation flowshop
- bayesian networks
- case study
- information systems