PLA-based permutation-scheduling
From MaRDI portal
Publication:3070880
zbMATH Open1204.90040MaRDI QIDQ3070880FDOQ3070880
Authors: Joanna Jȩdrzejowicz, Piotr Jedrzejowicz 
Publication date: 28 January 2011
Recommendations
- Population learning algorithm for the resource-constrained project scheduling
- Structure vs. efficiency of the cross-entropy based population learning algorithm for discrete-continuous scheduling with continuous resource discretisation
- Double population co-learning algorithm for permutation flow-shop scheduling problems
- A permutation-based approach for solving the job-shop problem
- Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
Cited In (3)
- Double population co-learning algorithm for permutation flow-shop scheduling problems
- A population learning algorithm for solving the generalized segregated storage problem
- Structure vs. efficiency of the cross-entropy based population learning algorithm for discrete-continuous scheduling with continuous resource discretisation
This page was built for publication: PLA-based permutation-scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070880)
