{"entities":{"Q6545105":{"pageid":14156259,"ns":120,"title":"Item:Q6545105","lastrevid":103520240,"modified":"2026-06-06T07:32:26Z","type":"item","id":"Q6545105","labels":{"en":{"language":"en","value":"Simple approximation algorithms for minimizing the total weighted completion time of precedence-constrained jobs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7854660"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6545105$D387E78C-28A2-4A39-89CE-80496BD92C73","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"89c93b1a9772e9a2eaecbd3f1cdeec4fa06064c9","datavalue":{"value":{"text":"Simple approximation algorithms for minimizing the total weighted completion time of precedence-constrained jobs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6545105$5DB7B719-4F9D-41F6-B368-98A682E39809","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b08297ec7dc4bf980276ab16812ad4b9f5d03e32","datavalue":{"value":"10.1137/1.9781611977936.8","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6545105$D3B88402-82F4-4E53-BB3B-5A136BA97DE5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5fd904a41fed9c2108c54cd1c7f9f463945356cf","datavalue":{"value":{"entity-type":"item","numeric-id":2072177,"id":"Q2072177"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6545105$4FEEBAAA-FD8C-4D79-B28E-753231C5C2FB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3853d416f0d1e3ee57e0bac48b6d7630ff2d185d","datavalue":{"value":{"entity-type":"item","numeric-id":5076725,"id":"Q5076725"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6545105$03276D72-9CE3-441D-B1FE-60CB6DCF2B3F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2c775b7be76488bf652b31b8283b5e517156ef32","datavalue":{"value":{"time":"+2024-05-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6545105$387672F7-939E-4199-8D68-526EB5F865CD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6545105$51257E2D-D68B-4091-9E42-8981FC61F888","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f7415c491734db421d17613a9344d328f0101610","datavalue":{"value":"7854660","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6545105$53A1F088-A2F9-4658-9371-5D559B4097A9","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6545105$AF1E9F57-7D13-4F89-A1E6-5E9AE2C65F77","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Simple approximation algorithms for minimizing the total weighted completion time of precedence-constrained jobs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Simple_approximation_algorithms_for_minimizing_the_total_weighted_completion_time_of_precedence-constrained_jobs"}}}}}