Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes.
Bayi ChengShanlin YangXiaoxuan HuKai LiPublished in: Int. J. Syst. Sci. (2014)
Keyphrases
- scheduling algorithm
- maximum lateness
- flowshop
- batch processing machines
- scheduling problem
- single machine
- response time
- sequence dependent setup times
- setup times
- scheduling strategy
- processing times
- special case
- total tardiness
- tabu search
- flowshop scheduling problems
- lot streaming
- np hard
- release dates
- precedence constraints
- single machine scheduling problem
- parallel machines
- feasible solution
- ant colony optimization
- upper bound