1. 录岭法,原晋江,The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard, European Journal of Operational Research,177 (2007) 1302–1309.
2. 录岭法,原晋江,Unbounded parallel batch scheduling with job delivery to minimize makespan,Operation Research Letters, 36 (2008) 477--480.
3. 录岭法, C.T. Ng, 张利齐, Optimal algorithms for single-machine scheduling with rejection to minimize the makespan, International Journal of Production Economics, 130(2011), 153–158.
4. C.T. Ng, 录岭法, On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time. Journal of Scheduling, 15(2012),391-398.
5. 录岭法,张利齐,万龙,Integrated production and delivery scheduling on a serial batch machine to minimize the makespan. Theoretical Computer Science,572(2015),50-57.