Approximating call-scheduling makespan in all-optical networks.
Luca BecchettiMiriam Di IanniAlberto Marchetti-SpaccamelaPublished in: J. Discrete Algorithms (2004)
Keyphrases
- optical networks
- scheduling problem
- release dates
- scheduling jobs
- unrelated parallel machines
- batch processing
- processing times
- flowshop
- single machine
- batch processing machines
- deteriorating jobs
- precedence constraints
- parallel machines
- service differentiation
- wavelength division multiplexing
- np hard
- routing and wavelength assignment
- maximum lateness
- identical parallel machines
- job shop
- single machine scheduling problem
- scheduling algorithm
- optimal solution
- network technologies
- resource allocation
- lower bound