In this paper, we propose an algorithm (CLLE) to find efficient" solutions for multi-objective sequencing problem on one machine .The Objectives are total completion time(∑Cj),total lateness(∑Lj), maximum Lateness(Lmax) and maximum earliness (Emax). A collection of dependent jobs(tasks) has to work out sequenced on one tool ,jobs j (j=1,2,3,….,n)required processing time pj and due history dj. Conclusions is formulated in the from the (CLLE) algorithm based on results of computational experiments.
Journal Type : Uluslararası
Relevant Articles | Author | # |
---|
Article | Author | # |
---|