Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach

DOI10.1080/00207160008804963zbMath0960.68011OpenAlexW2106137923MaRDI QIDQ4498115

No author found.

Publication date: 20 May 2001

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008804963

zbMATH Keywords

multiprocessor schedulinggenetic algorithmfirst fit decreasing method

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Fair on-line scheduling of a dynamic set of tasks on a single resource
• Resource constrained scheduling as generalized bin packing
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Scheduling with Concurrency-Based Constraints
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach