{"@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/Q5292811","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5292811","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q5292811","kernelVersion":"v1","immutable":true,"modified":"2025-04-18T18:51:47Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q5292811","name":"A new algorithm for minimizing makespan, <i>C</i><sub>max</sub>, in blocking flow-shop problem through slowing down the operations","headline":"A new algorithm for minimizing makespan, <i>C</i><sub>max</sub>, in blocking flow-shop problem through slowing down the operations","description":"scientific article; zbMATH DE number 5166917","url":"https://portal.mardi4nfdi.de/entity/Q5292811","datePublished":"2007-06-25","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q547113"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3030552"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1057/PALGRAVE.JORS.2602099","url":"https://doi.org/10.1057/PALGRAVE.JORS.2602099"},"sameAs":["https://doi.org/10.1057/PALGRAVE.JORS.2602099"]},"provenance":{"prov:generatedAtTime":"2025-04-18T18:51:47Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}