Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines.
Yusuke SaitoAkiyoshi ShiouraPublished in: ISCO (2022)
Keyphrases
- identical machines
- network design
- scheduling problem
- approximation schemes
- processing times
- approximation algorithms
- polynomial time approximation
- single machine
- precedence constraints
- np hard
- setup times
- network architecture
- communication networks
- flowshop
- special case
- parallel machines
- tabu search
- worst case
- dynamic programming