Minimizing makespan in a two-machine flowshop scheduling with batching and release time.
Lixin TangPeng LiuPublished in: Math. Comput. Model. (2009)
Keyphrases
- flowshop
- flowshop scheduling
- minimizing makespan
- scheduling problem
- flowshop scheduling problems
- total flowtime
- setup times
- processing times
- bicriteria
- special case
- single machine
- sequence dependent setup times
- tabu search
- parallel machines
- precedence constraints
- np hard
- neural network
- distributed systems
- release dates
- strongly np hard
- image segmentation
- branch and bound algorithm
- multi objective