Comparison of the Effect of Various Types of Genetic Algorithm Operators on the Total Amount of Tardiness in Flow Shop Problem
Flow Shop Scheduling Problem (FSSP) with the objective of minimizing total amount of tardiness is an NP-hard problem and many articles has been written about it. In this context, great attention has been paide to metahuristic techniques such as genetic algorithm. Additionally determination of the pa...
Saved in:
Main Authors: | Morteza Rasti Barzoki, Sajjad Raeisi |
---|---|
Format: | Article |
Language: | fas |
Published: |
University of Qom
2022-09-01
|
Series: | مدیریت مهندسی و رایانش نرم |
Subjects: | |
Online Access: | https://jemsc.qom.ac.ir/article_877_9961e9deac10563c4489fe5164a76a09.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improving the job shop scheduling algorithm to minimize total penalty costs considering maintenance activity
by: Puryani Puryani, et al.
Published: (2024-12-01) -
A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
by: Chia-Shin Chung, et al.
Published: (2012-01-01) -
The effective management of teachers’ habitual tardiness: Protecting scheduled teaching time
by: Michael Moreti Mahome, et al.
Published: (2024-12-01) -
A novel mathematical model with an LCA-based solution method to minimize earliness-tardiness costs on a single machine by considering batch delivery
by: Zahra Pourali, et al.
Published: (2025-03-01) -
Selected aspects of amount relatives: The Romanian-English connection
by: Alexander Grosu, et al.
Published: (2015-12-01)