Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences.
T. C. E. ChengSvetlana A. KravchenkoBertrand M. T. LinPublished in: J. Oper. Res. Soc. (2021)
Keyphrases
- identical machines
- processing times
- scheduling problem
- identical parallel machines
- job scheduling
- single machine
- fixed number
- parallel machines
- single server
- batch processing machines
- flowshop
- scheduling decisions
- scheduling jobs
- maximum lateness
- precedence constraints
- polynomial time approximation
- worst case
- computational complexity
- database
- client server
- np hard
- web server
- wafer fabrication
- information systems
- parallel machine scheduling problem
- multiprocessor systems
- hidden markov models
- setup times
- scheduling algorithm
- central server
- job shop
- parallel processors
- single machine scheduling problem
- resource allocation
- sequential patterns
- release times
- parallel processing