Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass.

Ilya Chernykh Ekaterina Lgotina

Published in: CoRR (2019)

Keyphrases

open shop
np complete
flowshop
job shop
approximation algorithms
special case
scheduling problem
parallel machines
shortest path
completion times
np hard
polynomially solvable
computational complexity
ad hoc networks
weighted sum
multistage
evolutionary algorithm