A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
B. Shahul Hamid KhanG. PrabhaharanP. AsokanPublished in: Int. J. Comput. Math. (2007)
Keyphrases
- bicriteria
- flowshop
- scheduling problem
- maximum tardiness
- minimizing makespan
- tabu search
- makespan minimization
- strongly np hard
- np hard
- efficient solutions
- sequence dependent setup times
- single machine
- processing times
- special case
- integer linear programming
- setup times
- maximum lateness
- shortest path problem
- minimizing total tardiness
- parallel machines
- knapsack problem
- precedence constraints
- permutation flowshop
- unrelated parallel machines
- optimal solution
- branch and bound algorithm
- combinatorial optimization problems
- search procedure
- hybrid algorithm
- cost function