A branch-and-bound algorithm for minimising the number of tardy jobs in a two-machine flow-shop problem with release dates.
Mostafa Abouei ArdakanAli HakimianMohammad Taghi RezvanPublished in: Int. J. Comput. Integr. Manuf. (2014)
Keyphrases
- release dates
- branch and bound algorithm
- processing times
- single machine scheduling problem
- scheduling problem
- single machine
- np hard
- lower bound
- branch and bound
- precedence constraints
- sequence dependent setup times
- upper bound
- combinatorial optimization
- maximum lateness
- flowshop
- optimal solution
- resource consumption
- special case
- integer programming