Affiliation:
1. Afe Babalola University
Abstract
This paper considers the bicriteria scheduling problem of minimizing the total completion time and maximum lateness with zero release dates. The problem is NP hard, though Early Due Date (EDD) and Shortest Processing Time (SPT) rules yielded optimal solutions for maximum lateness and total completion time, respectively if each criterion were to be considered singly. Thus, the values of each of the criteria for the two proposed heuristics; SII and PI were compared to the optimal solution of the sub problems. Results of computational experiment on job sizes varies from 5-100 jobs showed that the two proposed solution methods yielded results not significantly different from the optimal. This is because the two heuristic yielded results not significantly from the optimal sub-problems for the two performance measures at 95% significant level.
Publisher
Trans Tech Publications, Ltd.
Reference15 articles.
1. E.O. Oyetunji, A.E. Oluleye, Heuristics for minimizing the total completion time and number of tardy jobs simultaneously on single machine with release time. Research Journal of Applied Sciences 32 (2008) 147–152.
2. M., Ehrgott, X., Gandibleux, A Survey and Annotated Bibliography of Multi Objective Combinatorial Optimization. Operation Research Spectrum. 22 (2000) 425–460.
3. M. L., Pinedo, Scheduling Theory, Algorithms and Systems.1st ed. Springer, New York, (2008).
4. K. R Baker., D. Trietsch, Principles of sequencing and scheduling, Ist ed. John Wiley & Sons, Canada, (2013).
5. Information on http://mathworld.wolfram.com/ComplexityTheory.html.