Scheduling Dependent Coflows with Guaranteed Job Completion Time.
Yang LiuWenxin LiKeqiu LiHeng QiXiaoyi TaoSheng ChenPublished in: Trustcom/BigDataSE/ISPA (2016)
Keyphrases
- job scheduling
- scheduling problem
- batch processing
- identical parallel machines
- identical machines
- deteriorating jobs
- job shop
- release times
- scheduling jobs
- processing times
- flowshop
- release dates
- maximum lateness
- single machine
- single machine scheduling problem
- dynamic scheduling
- scheduling algorithm
- completion times
- scheduling decisions
- round robin
- resource constraints
- batch processing machines
- flexible manufacturing systems
- parallel machines
- production scheduling
- information systems
- shortest processing time
- database
- sequence dependent setup times
- computational grids
- setup times
- job shop scheduling
- single server
- grid environment
- dynamic programming
- lower bound
- genetic algorithm
- neural network