Scheduling for IC sort and test with preemptiveness via Lagrangian relaxation.
Tsung-Rian ChenTsu-Shuan ChangCheng-Wu ChenJen KaoPublished in: IEEE Trans. Syst. Man Cybern. (1995)
Keyphrases
- lagrangian relaxation
- setup times
- integer programming
- np hard
- lower bound
- column generation
- total weighted tardiness
- feasible solution
- precedence relations
- scheduling problem
- unit commitment
- branch and bound algorithm
- dynamic programming
- linear programming
- lower and upper bounds
- relaxation algorithm
- mixed integer programming
- precedence constraints
- dual decomposition
- scheduling algorithm
- mixed integer program
- evolutionary algorithm
- approximation algorithms
- single machine scheduling problem
- mixed integer linear programs
- lagrangian heuristic
- job shop scheduling problem
- tabu search
- shortest path
- cost function