Lin, Meng-Ye; Kuo, Yarlin - In: Operations Research Perspectives 4 (2017), pp. 49-55
problems within 1 h. For maximum lateness problems, the best model solves almost all the problems up to 30-jobs within 11 min … models, to solve single machine family scheduling problems. The objectives are total weighted completion time and maximum … lateness, respectively. Experiment results indicate that there are remarkable improvements in computational efficiency when …