{"@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/Q796987","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q796987","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q796987","kernelVersion":"v1","immutable":true,"modified":"2026-01-05T17:43:22Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q796987","name":"Scheduling independent 2-processor tasks to minimize schedule length","headline":"Scheduling independent 2-processor tasks to minimize schedule length","description":"scientific article; zbMATH DE number 3866579","url":"https://portal.mardi4nfdi.de/entity/Q796987","datePublished":"1984-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q796986"},{"@id":"https://portal.mardi4nfdi.de/entity/Q224835"},{"@id":"https://portal.mardi4nfdi.de/entity/Q213368"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q63092"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/0020-0190(84)90006-1","url":"https://doi.org/10.1016/0020-0190(84)90006-1"},"sameAs":["https://doi.org/10.1016/0020-0190(84)90006-1"],"comment":"The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. In the paper an O(n log n) algorithm is given for scheduling n preemtable tasks on m processors to minimize schedule length, when tasks are divided into two subsets. Each task from the first subset requires one processor at a time, and each task from the second subset requires two processors at a time for its processing.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q4131987"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4198056"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4404788"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3929047"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5583470"}]},"provenance":{"prov:generatedAtTime":"2026-01-05T17:43:22Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}