Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach.
Mohamed K. OmarSiew-Chein TeoPublished in: Appl. Math. Comput. (2006)
Keyphrases
- earliness tardiness
- completion times
- identical parallel machines
- scheduling problem
- single machine
- single machine scheduling problem
- processing times
- release dates
- flowshop
- mixed integer programming
- parallel machines
- branch and bound algorithm
- combinatorial optimization
- feasible solution
- tabu search
- strongly np hard
- np hard
- dynamic programming
- search procedure
- special case
- lagrangian relaxation
- hybrid algorithm
- precedence constraints
- resource consumption
- response time