Semi-online Machine Covering on Two Hierarchical Machines with Discrete Processing Times.
Gangxiong WuWeidong LiPublished in: NCTCS (2018)
Keyphrases
- processing times
- flowshop
- identical machines
- scheduling problem
- parallel machines
- scheduling jobs
- single machine
- makespan minimization
- setup times
- earliness tardiness
- manufacturing cell
- scheduling decisions
- sequence dependent setup times
- online learning
- special case
- total weighted tardiness
- release dates
- single machine scheduling problem
- identical parallel machines
- polynomially solvable
- worst case performance ratio
- assembly line
- precedence relations
- job processing times
- tabu search
- communication delays
- competitive ratio
- completion times
- resource consumption
- finite number
- neural network
- release times
- lower bound