{"entities":{"Q6260604":{"pageid":13397360,"ns":120,"title":"Item:Q6260604","lastrevid":94803458,"modified":"2026-06-05T07:43:32Z","type":"item","id":"Q6260604","labels":{"en":{"language":"en","value":"Analysis of the Optimal Resource Allocation for a Tandem Queueing System"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900244331"}},"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":"Q6260604$788DFB24-D407-4291-BFCB-591ED5022D28","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c0e1a3c133e556bcc320e26229fb11a9d418fba9","datavalue":{"value":{"time":"+2015-04-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6260604$296AB4F0-1ADB-4A9B-B941-4EA60AB9E41F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"20188a0d00ac63cf26ed8032857832540b76ced0","datavalue":{"value":{"entity-type":"item","numeric-id":6160727,"id":"Q6160727"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6260604$6F4F5375-C427-4996-B69F-C116AE81265F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2075c03d2ff2827463e47ea043c0125bba56e491","datavalue":{"value":{"entity-type":"item","numeric-id":2425613,"id":"Q2425613"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6260604$934E09D8-8F1F-4C39-8E7F-B9F9982E86FE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d9ab834ce264c3cb3e22f97dd97896c4a628bc49","datavalue":{"value":{"entity-type":"item","numeric-id":6251051,"id":"Q6251051"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6260604$C481B96F-889F-43E9-8135-CC94AC26913F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9eb449567bb391899f1b93c0d8a05b7980a55753","datavalue":{"value":"900244331","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6260604$674D4201-E0CB-4260-94B0-8D0219EAF6CF","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":"Q6260604$4DA2024B-6781-4F72-A0E5-D095F1FDD768","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Analysis of the Optimal Resource Allocation for a Tandem Queueing System","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Analysis_of_the_Optimal_Resource_Allocation_for_a_Tandem_Queueing_System"}}}}}