Total completion time minimization on multiple machines subject to machine availability and makespan constraints.
Yumei HuoHairong ZhaoPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- flowshop
- scheduling problem
- batch processing
- real time
- lower bound
- parallel machines
- precedence constraints
- learning machines
- job processing times
- minimizing makespan
- sequence dependent setup times
- completion times
- single machine
- processing times
- setup times
- release dates
- support vector
- open shop
- objective function
- learning algorithm