Online scheduling on unbounded parallel-batch machines with incompatible job families.
Ji TianT. C. Edwin ChengC. T. NgJinjiang YuanPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- identical machines
- parallel machines
- wafer fabrication
- scheduling problem
- online algorithms
- parallel processors
- batch mode
- single machine
- online learning
- processing times
- batch processing
- scheduling algorithm
- parallel processing
- shared memory
- massively parallel
- online resources
- batch processing machines
- real time
- website
- distributed memory
- precedence constraints
- round robin
- parallel implementation
- resource allocation
- lower bound
- dynamic scheduling
- sequence dependent setup times
- information systems
- identical parallel machines
- multiprocessor systems
- manufacturing cell
- artificial intelligence
- data sets