Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart.
Hailing LiuJinjiang YuanPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- identical machines
- batch processing
- equal length
- parallel machines
- wafer fabrication
- processing times
- scheduling problem
- job scheduling
- random walk
- single machine
- unrelated parallel machines
- flowshop
- scheduling jobs
- batch processing machines
- maximum lateness
- minimizing total tardiness
- sequence dependent setup times
- batch size
- online learning
- online algorithms
- dispatching rule
- real time
- shared memory
- parallel computing
- identical parallel machines
- release dates
- parallel machine scheduling problem
- precedence constraints
- strongly np hard
- minimize total
- batch mode
- polynomial time approximation
- single server
- job shop scheduling problem
- minimizing makespan
- deteriorating jobs