{"@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/Q5363000","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5363000","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q5363000","kernelVersion":"v1","immutable":true,"modified":"2026-01-23T19:42:53Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q5363000","name":"A dynamic programming framework for non-preemptive scheduling problems on multiple machines","headline":"A dynamic programming framework for non-preemptive scheduling problems on multiple machines","description":"scientific article; zbMATH DE number 6786315","url":"https://portal.mardi4nfdi.de/entity/Q5363000","datePublished":"2017-10-05","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1709964"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1718127"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1743114"},{"@id":"https://portal.mardi4nfdi.de/entity/Q835595"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5362974"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1137/1.9781611973730.72","url":"https://doi.org/10.1137/1.9781611973730.72"},"sameAs":["https://doi.org/10.1137/1.9781611973730.72"]},"provenance":{"prov:generatedAtTime":"2026-01-23T19:42:53Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}