Single Machine Scheduling To Minimize a Function of Square Completion Time and Maximum Earliness Simultaneously
Journal of Al-Qadisiyah for Computer Science and Mathematics,
2010, Volume 2, Issue 1, Pages 1-18
AbstractIn this study, to minimize a function of two cost criteria for scheduling n jobs on a single machine , the problem is discussed :
“ Minimizing a function of total square completion time and maximum Earliness simultaneously”.
For this problem we proposed some algorithms to find exact(optimal) solution for hierarchical case and efficient (pareto optimal) solutions for simultaneous case. Also we proposed branch and bound algorithm to find exact solution for sum of total square completion time and maximum Earliness ,and present algorithm D to find exact solution in a fast way with respect to (BAB) method. We present computational experience for the (BAB) method and algorithm(D) on a large set of test problems
- Article View: 42
- PDF Download: 51