A modified LPT algorithm for the two uniform parallel machine makespan minimization problem.
Christos KoulamasGeorge J. KyparisisPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- makespan minimization
- parallel machines
- scheduling problem
- polynomial time approximation
- worst case
- computational complexity
- total weighted tardiness
- processing times
- objective function
- special case
- convex hull
- optimal solution
- hybrid algorithm
- single machine
- linear programming
- probabilistic model
- np hard
- cost function
- energy function
- metaheuristic
- theoretical analysis
- approximation algorithms
- memetic algorithm
- job shop scheduling problem
- precedence constraints
- dynamic programming