Solving Multi-Criteria Problem by Using Efficient Algorithm

Abstract

For multi criteria sequencing problem on one machine, we propose an algorithm total completion total lateness maximum lateness maximum earliness (CLLE) to find efficient solutions in this paper. The criteria are total completion time(∑Cj), total lateness(∑Lj), maximum Lateness (Lmax) and maximum earliness (Emax). A collection of n independent jobs (tasks) has to be sequenced on one machine jobs j (j=1, 2, 3, …., n) wanted processing time pj and due date dj. Conclusions is formulated on the competence of the (CLLE) algorithm based on results from computational experiments.