GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times.
Francisco J. RodríguezChristian BlumCarlos García-MartínezManuel LozanoPublished in: Ann. Oper. Res. (2012)
Keyphrases
- completion times
- release dates
- single machine
- single machine scheduling problem
- scheduling problem
- processing times
- weighted sum
- absolute deviation
- flowshop
- branch and bound algorithm
- path relinking
- setup times
- search procedure
- queue length
- precedence constraints
- np hard
- lower bound
- steady state
- neural network
- optimization algorithm
- response time
- dynamic programming
- objective function