Using hybrid GA-PSO algorithm to solve problem in machine scheduling
From MaRDI portal
Cites work
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- Minimizing tardy jobs in a flowshop with common due date
- Optimal two- and three-stage production schedules with set-up time included
- Permutation flow shop scheduling with earliness and tardiness penalties
This page was built for publication: Using hybrid GA-PSO algorithm to solve problem in machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5035071)