An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times.
Dvir ShabtayShlomo KarhiPublished in: Discret. Optim. (2012)
Keyphrases
- asymptotically optimal
- high multiplicity
- processing times
- worst case performance ratio
- computational complexity
- np hard
- single machine
- objective function
- optimal solution
- single machine scheduling problem
- cost function
- scheduling problem
- neural network
- arrival rate
- worst case
- call center
- flowshop
- ant colony optimization
- search space
- learning algorithm
- machine learning