On Bornological Structure

For multi criteria sequencing problem on one machine, we propose a modified branch and bound algorithm (MBAB) to find efficient (pareto optimal) solutions in this paper. The criteria are total completion time ( ), total lateness ( ), and maximum tardiness (Tmax). A collection of n independent tasks(jobs) has to be sequenced on one machine , tasks(jobs)j (j=1,2,3,…..,n) requires processing time Pj and due data dj . The MBAB algorithm depends on branch and bound technique. Applied examples are used to show applicability of MBAB algorithm. The MBAB algorithm is compared with complete enumeration method (CEM). Conclusions are formulated on the performance of the (MBAB) algorithm.