scientific article; zbMATH DE number 558542

MaRDI QIDQ4289898zbMATH OpenFDO

Authors Roberto Tadei, R. Rolando, F. Della Croce

Publication date 28 April 1994

zbMATH Keywords

genetic algorithmproject schedulingtotal weighted tardinessneighbourhood searchjob shop problemprecendence constraints

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms
• Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
• Genetic algorithm for the resource-constrained project scheduling problem
• Project scheduling with multiple modes: A genetic algorithm
• A robust genetic algorithm for resource allocation in project scheduling
• scientific article; zbMATH DE number 1300399
• An Improved Genetic Algorithm for the Resource-Constrained Project Scheduling Problem
• A genetic algorithm for the resource constrained multi-project scheduling problem

Cited in

(4)

• scientific article; zbMATH DE number 5132361 (Why is no real title available?)
• Genetic algorithms for project management
• Deterministic job-shop scheduling: Past, present and future
• Metaheuristics: A bibliography

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289898)