PLA-based permutation-scheduling

MaRDI QIDQ3070880zbMATH OpenFDO

Authors Joanna Jȩdrzejowicz, Piotr Jedrzejowicz

Publication date 28 January 2011

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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)