Minimizing the Sum of Weighted Completion Times with Unrestricted Weights.
Mauro Dell'AmicoSilvano MartelloDaniele VigoPublished in: Discret. Appl. Math. (1995)
Keyphrases
- completion times
- weighted sum
- absolute deviation
- scheduling problem
- single machine
- open shop
- sum of completion times
- single machine scheduling problem
- linear combination
- arrival times
- objective function
- release times
- processing times
- queue length
- flowshop
- number of late jobs
- optimization problems
- worst case
- dynamic programming
- computational complexity