Affiliation:
1. Afe Babalola University
2. University of Ibadan
3. Lagos State University
Abstract
This paper considers the bicriteria scheduling problem of minimizing the composite function of total tardiness and total flow time on single machine with non-zero release dates. The problem is strongly Non Polynomial (NP). Thus, two heuristics SA7 and SA8 were proposed to solve the problem. The generalized algorithm and the branch and bound procedure were also implemented. The four solution methods were tested on a total of 800 randomly generated problems ranging from 5 to 1000 jobs. Results based on effectiveness and efficiency show that the SA7 heuristic is the most suited solution method to solve the problem.
Publisher
Trans Tech Publications, Ltd.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献