Minimising the total completion time in a single machine scheduling problem under bimodal flexible periodic availability constraints.
O. MashkaniGhasem MoslehiPublished in: Int. J. Comput. Integr. Manuf. (2016)
Keyphrases
- single machine scheduling problem
- release times
- precedence constraints
- single machine
- completion times
- branch and bound algorithm
- processing times
- release dates
- weighted tardiness
- scheduling problem
- combinatorial optimization
- resource consumption
- setup times
- genetic algorithm
- constraint satisfaction
- branch and bound