An Efficient Algorithm for Solving Multi- Objective Problem
Main Article Content
Abstract
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.
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
