Online scheduling of two-machine flowshop with lookahead and incompatible job families.
Xia QianXingong ZhangPublished in: J. Comb. Optim. (2023)
Keyphrases
- flowshop
- scheduling problem
- sequence dependent setup times
- maximum lateness
- processing times
- job processing times
- setup times
- minimizing total tardiness
- unrelated parallel machines
- parallel machines
- single machine
- job shop
- flowshop scheduling
- bicriteria
- dispatching rule
- release dates
- total tardiness
- minimizing makespan
- identical parallel machines
- preventive maintenance
- makespan minimization
- np hard
- identical machines
- scheduling jobs
- number of tardy jobs
- precedence constraints
- strongly np hard
- total weighted tardiness
- completion times
- online learning
- flowshop scheduling problems
- special case
- robotic cell
- manufacturing cell
- lot streaming
- maximum tardiness
- permutation flowshop
- job shop scheduling problem
- shortest processing time
- computational complexity