Eren, TamerGüner, Ertan2020-06-252020-06-252007closedAccess0315-59861916-0615https://doi.org10.3138/infor.45.2.75https://hdl.handle.net/20.500.12587/3908This paper considers a bicriteria scheduling problem with a learning effect on a single machine to minimize a weighted sum of total completion time and total tardiness. A mathematical programming model is developed for the problem, and optimal solutions are only obtained up to 25 jobs. Since the problem is NP-hard, heuristic methods based on tabu search and random search are proposed to solve large size problems, and their effectiveness is comparatively investigated considering 3600 problems.eninfo:eu-repo/semantics/closedAccesssingle machine schedulingbicriteria schedulinglearning effectmathematical programmingheuristic methodtabu searchArticle452758110.3138/infor.45.2.752-s2.0-45749118684Q3WOS:000257231600003Q4