New upper and lower bounds for online scheduling with machine cost.
György DósaZhiyi TanPublished in: Discret. Optim. (2010)
Keyphrases
- upper and lower bounds
- upper bound
- lower bound
- batch processing
- scheduling problem
- lower and upper bounds
- scheduling decisions
- online learning
- sample complexity
- manufacturing cell
- material handling
- scheduling algorithm
- parallel machines
- flowshop
- wafer fabrication
- preventive maintenance
- processing times
- total cost
- learning process