A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine.
Qiulan ZhaoJinjiang YuanPublished in: Oper. Res. Lett. (2019)
Keyphrases
- single machine scheduling
- single machine scheduling problem
- processing times
- flowshop
- single machine
- branch and bound algorithm
- scheduling problem
- combinatorial optimization
- computational complexity
- upper bound
- precedence constraints
- resource consumption
- evolutionary algorithm
- linear programming
- tabu search
- search procedure