Genetic algorithm for the jump number scheduling problem

DOI10.1023/A:1006069500025MaRDI QIDQ1272946zbMATH OpenOpenAlexFDO

Authors Alioune Ngom

Publication date 2 December 1998

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1006069500025

zbMATH Keywords

genetic algorithmspartially ordered setlinear extensionjump number scheduling problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorics of partially ordered sets (06A07)

Recommendations

• Genetic algorithms for task scheduling problem
• A genetic algorithm methodology for complex scheduling problems
• A genetic algorithm applied to a classic job-shop scheduling problem
• A genetic algorithm for the flexible job-shop scheduling problem
• Genetic algorithm with forward-backward scheduling for job-shop problems
• Un algoritmo genético para un problema de horarios con restricciones especiales
• Genetic algorithms for job shop scheduling problems with alternative routings
• A genetic algorithm for the job shop problem
• A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems

Cited in

(1)

• The runtime of the compact genetic algorithm on jump functions

This page was built for publication: Genetic algorithm for the jump number scheduling problem

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