Using hybrid GA-PSO algorithm to solve problem in machine scheduling
From MaRDI portal
Publication:5035071
DOI10.1080/09720529.2021.1958998OpenAlexW4200196412MaRDI QIDQ5035071
Tahani Jabbar Khraibet, Wisam Kamil Ghafil
Publication date: 21 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2021.1958998
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) General applied mathematics (00A69) General theory of mathematical modeling (00A71)
Uses Software
Cites Work
- Unnamed Item
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
- Minimizing tardy jobs in a flowshop with common due date
- Optimal two- and three-stage production schedules with setup times included
- Permutation flow shop scheduling with earliness and tardiness penalties
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
This page was built for publication: Using hybrid GA-PSO algorithm to solve problem in machine scheduling