{"entities":{"Q6845796":{"pageid":20571454,"ns":120,"title":"Item:Q6845796","lastrevid":75020734,"modified":"2026-04-17T13:39:21Z","type":"item","id":"Q6845796","labels":{"en":{"language":"en","value":"Approximation algorithms for parallel batch machine scheduling of malleable jobs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8171401"}},"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":"Q6845796$7443BE03-1ABB-48CB-B1EA-65560DAD8472","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8d09abc7498776bb2c72fffe493540e7f422a641","datavalue":{"value":{"text":"Approximation algorithms for parallel batch machine scheduling of malleable jobs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6845796$AFC2C998-E327-4491-BB30-523358B16B32","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"98cab738bcab9c2fe5ac8a937aa2365facd6fe96","datavalue":{"value":"10.1007/S10878-026-01391-X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6845796$107E4773-9753-4F8F-ADD2-B16EC3A334F0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e1e209e04b0a02ea6cd0adb3ca36368fe074a27d","datavalue":{"value":{"entity-type":"item","numeric-id":6845795,"id":"Q6845795"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6845796$5A589485-AAC9-4211-83D8-5A902F2BCA7B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"351522313d2c86b61befa872c6da9cac85b0ca64","datavalue":{"value":{"entity-type":"item","numeric-id":328700,"id":"Q328700"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6845796$37643594-F98D-4513-8D6D-BC82C0ADC880","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ea648942772927ed027401b730f401bddf676829","datavalue":{"value":{"entity-type":"item","numeric-id":387815,"id":"Q387815"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6845796$B848A362-D7F0-4BA3-BEBA-5419FBCDF13D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"dcf8815e3b257674fa147da7a4e7c92c91c0b3e3","datavalue":{"value":{"entity-type":"item","numeric-id":185429,"id":"Q185429"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6845796$98128921-699A-4373-997F-E7EDC88639EF","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d0e78489bbe47ef60a61d243e2d28e513b4676ba","datavalue":{"value":{"time":"+2026-03-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6845796$6CDEFA39-CE4A-44FE-855D-E46466CA9305","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"30e0158d39e8dcc6ee00ca7b3ae626e5899d5903","datavalue":{"value":"90Cxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6845796$DFE9A57E-69E4-4FE3-BCF8-6337860E4ACA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f0427176caf2b1bbddf624b7d291fd4d146cc7e6","datavalue":{"value":"8171401","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6845796$A879D5EC-CB1C-4848-894F-B56CE7256C20","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"44fac2abe78ae44f6c642045e37d45dc6bccca62","datavalue":{"value":"cloud computing","type":"string"},"datatype":"string"},"type":"statement","id":"Q6845796$0E6E95FB-9F00-4766-B48E-CF91C512FD8B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0de600cf8191fa1f423fd01c9a02b172072a7391","datavalue":{"value":"approximation algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6845796$9AFBF414-CE93-4C7F-B754-9186D5A4C20A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"730bd631158d8540835bfcc9db275e0548b17ffc","datavalue":{"value":"parallelism degree","type":"string"},"datatype":"string"},"type":"statement","id":"Q6845796$DBB6A74C-49A2-4B44-AF40-B7DFC147F00E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"59dfd279cfd54a58f87fb2ecbda8c1867a88a9af","datavalue":{"value":"parallel batch scheduling","type":"string"},"datatype":"string"},"type":"statement","id":"Q6845796$D38687CD-D082-4511-A5AA-0ECE0009A68D","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":"Q6845796$DC6CBD7D-FF44-44E5-A293-C412A7A52D50","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximation algorithms for parallel batch machine scheduling of malleable jobs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Approximation_algorithms_for_parallel_batch_machine_scheduling_of_malleable_jobs"}}}}}