Harmony search algorithm to enhance approach to permutation flow shop scheduling problem
The permutation flow-shop scheduling problem (PFSP) is one of the widely analysed and investigated problems within the general field of scheduling, as its major focus is on the allocation and sequencing of a set of jobs across a set of machines in order to minimize the makespan or satisfy other cri...
Saved in:
| Main Author: | Муса А. Хамид |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Siberian Scientific Center DNIT
2024-11-01
|
| Series: | Информатика. Экономика. Управление |
| Subjects: | |
| Online Access: | https://oajiem.com/index.php/24/article/view/103 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Augmented ɛ‐constraint‐based matheuristic methodology for Bi‐objective production scheduling problems
by: Jiaxin Fan
Published: (2024-12-01) -
A novel artificial intelligence search algorithm and mathematical model for the hybrid flow shop scheduling problem
by: Filip Vidojević, et al.
Published: (2025-02-01) -
Artificial neural network for solving flow shop optimization problem with sequence independent setup time
by: Sadki Hajar, et al.
Published: (2024-12-01) -
Hyper-Heuristics and Scheduling Problems: Strategies, Application Areas, and Performance Metrics
by: Alonso Vela, et al.
Published: (2025-01-01) -
Flow shop scheduling decisions through Techniques for Order Preference by Similarity to an Ideal Solution (TOPSIS)
by: Arun Gupta, et al.
Published: (2016-07-01)