New measures of algorithms quality for permutation flow-shop scheduling problem
Saved in:
| Main Authors: | Radosław Puka, Iwona Skalna, Tomasz Derlecki |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Information Processing Society
2023-09-01
|
| Series: | Annals of computer science and information systems |
| Online Access: | https://annals-csis.org/Volume_35/drp/pdf/7072.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
EPO Extension of Dispatching Rules to Minimize Effects of Time Uncertainty in Production Scheduling
by: Radosław Puka, et al.
Published: (2025-07-01) -
A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems
by: Bilal Khurshid, et al.
Published: (2025-04-01) -
Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time
by: Jabrane Belabid, et al.
Published: (2020-01-01) -
A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling
by: Ruochen Liu, et al.
Published: (2013-01-01) -
AVOA and ALO Algorithm for Energy-Efficient No-Idle Permutation Flow Shop Scheduling Problem: A Comparison Study
by: Yolanda Mega Risma, et al.
Published: (2023-12-01)