Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine.
Jinquan LiXuehai YuanE. S. LeeDehua XuPublished in: Comput. Math. Appl. (2011)
Keyphrases
- single machine
- earliness tardiness
- processing times
- scheduling problem
- minimize total
- parallel machines
- completion times
- number of late jobs
- release times
- single machine scheduling problem
- release dates
- shortest processing time
- sequence dependent setup times
- np hard
- flowshop
- precedence constraints
- tabu search
- dynamic programming
- computational complexity