scientific article; zbMATH DE number 2047283

MaRDI QIDQ4451471zbMATHFDO

Authors Tatjana Davidović, Nenad Mladenović

Publication date 26 February 2004

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
• Genetic algorithms for task scheduling problem
• Multiprocessor scheduling in a genetic paradigm
• A bipartite genetic algorithm for multi-processor task scheduling
• Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach

Cited in

(2)

• PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
• Multiprocessor scheduling in a genetic paradigm

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 Q4451471)