Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times.
Ming LiuChengbin ChuYinfeng XuFeifeng ZhengPublished in: J. Comb. Optim. (2011)
Keyphrases
- processing times
- identical machines
- service provision
- scheduling problem
- identical parallel machines
- flowshop
- single machine
- release dates
- scheduling jobs
- precedence relations
- scheduling decisions
- setup times
- manufacturing cell
- service delivery
- parallel machines
- user oriented
- release times
- online learning
- service providers
- single machine scheduling problem
- information services
- special case
- mobile services
- e government
- context aware
- polynomial time approximation
- service discovery
- context awareness
- public administration
- tabu search
- completion times
- strongly np hard
- ambient intelligence
- service selection
- smart environments
- precedence constraints