Approximation methods to solve a single machine scheduling problem with fuzzy due date to minimize multi-objective functions
Main Article Content
Abstract
In this paper present three methodant colony optimization (ACO), particle swarm optimization (PSO) and bees algorithm optimization (BAO) to the solution multi-objective function of single machine problem with the fuzzy due date. The objective function to minimize total completion time and maximum lateness with a fuzzy due date. By a computer simulation used to compare the performance of each algorithm with another one from where accuracy and time.
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.
