Article ID: | iaor20106574 |
Volume: | 45 |
Issue: | 2 |
Start Page Number: | 75 |
End Page Number: | 81 |
Publication Date: | May 2007 |
Journal: | INFOR: Information Systems and Operational Research |
Authors: | Gner Ertan, Eren Tamer |
This 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.