{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5485151","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5485151","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q5485151","kernelVersion":"v1","immutable":true,"modified":"2026-01-11T22:24:28Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q5485151","name":"An adaptive genetic algorithm for solving a class of combinatorial scheduling problems","headline":"An adaptive genetic algorithm for solving a class of combinatorial scheduling problems","description":"scientific article; zbMATH DE number 5050452","url":"https://portal.mardi4nfdi.de/entity/Q5485151","datePublished":"2006-08-29","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3170349"},{"@id":"https://portal.mardi4nfdi.de/entity/Q519761"}]},"provenance":{"prov:generatedAtTime":"2026-01-11T22:24:28Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}