Online Makespan Scheduling with Job Migration on Uniform Machines.
Matthias EnglertDavid MezlafMatthias WestermannPublished in: Algorithmica (2021)
Keyphrases
- scheduling problem
- flowshop
- identical parallel machines
- processing times
- identical machines
- scheduling jobs
- release dates
- single machine
- parallel machines
- batch processing
- maximum lateness
- parallel machine scheduling problem
- batch processing machines
- deteriorating jobs
- unrelated parallel machines
- job processing times
- sequence dependent setup times
- setup times
- strongly np hard
- lot streaming
- job shop
- precedence constraints
- bicriteria
- total weighted tardiness
- online learning
- np hard
- job scheduling
- minimizing makespan
- tabu search
- single machine scheduling problem
- scheduling decisions
- release times
- job shop scheduling
- fixed number
- dispatching rule
- manufacturing cell
- special case
- real time
- open shop
- lower bound
- response time
- branch and bound algorithm
- completion times
- production scheduling
- resource consumption