Approximating Call-Scheduling Makespan in All-Optical Networks.
Luca BecchettiMiriam Di IanniAlberto Marchetti-SpaccamelaPublished in: WG (2000)
Keyphrases
- optical networks
- scheduling problem
- release dates
- scheduling jobs
- unrelated parallel machines
- batch processing
- single machine
- processing times
- flowshop
- deteriorating jobs
- batch processing machines
- parallel machines
- service differentiation
- precedence constraints
- single machine scheduling problem
- scheduling algorithm
- np hard
- wireless networks
- maximum lateness
- wavelength division multiplexing
- routing and wavelength assignment
- lower bound
- identical parallel machines
- case study
- completion times
- image quality
- open source
- computational complexity
- optimal solution