Minimization of Weighted Completion Times in Path-based Coflow Scheduling.
Alexander EcklLuisa PeterMaximilian SchifferSusanne AlbersPublished in: CoRR (2019)
Keyphrases
- completion times
- scheduling problem
- single machine
- weighted sum
- single machine scheduling problem
- sum of completion times
- open shop
- release times
- processing times
- absolute deviation
- objective function
- unrelated parallel machines
- flowshop
- release dates
- queue length
- resource consumption
- tabu search
- np hard
- evolutionary algorithm
- genetic algorithm
- number of late jobs
- response time
- supply chain
- optimization problems