{"entities":{"Q1819702":{"pageid":1830444,"ns":120,"title":"Item:Q1819702","lastrevid":69219225,"modified":"2026-04-13T05:33:33Z","type":"item","id":"Q1819702","labels":{"en":{"language":"en","value":"Optimal combinations of priority scheduling rules"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3993284"}},"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":"Q1819702$FFCBBABA-B2F3-47E3-9830-6C73EF919F18","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"209e4be38b17dc70f438e0b349c1f6ec5f80ef1c","datavalue":{"value":{"text":"Optimal combinations of priority scheduling rules","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1819702$113817D8-FD4D-49DD-BF24-C0C70C11D8CB","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2586f6d83e0e9c9232dd119fdb3ef1ea3afa2c70","datavalue":{"value":"0613.90051","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1819702$E3819454-2438-4C8D-85E4-1ADE281A717D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"fad7240a154f4e2363451e05a987042876d83e98","datavalue":{"value":{"entity-type":"item","numeric-id":1135763,"id":"Q1135763"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1819702$77D403A6-2837-4177-ABD3-DDBFAAD63460","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9dc9b634cdf436d40c62c82fab2f063111b714b9","datavalue":{"value":{"entity-type":"item","numeric-id":1135765,"id":"Q1135765"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1819702$22D22BA3-B9D0-44CD-9463-5FA02268DB60","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"33359fd8a77e9cce0cfaf7c91dc047e11a0fed75","datavalue":{"value":{"entity-type":"item","numeric-id":109332,"id":"Q109332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1819702$491F50F7-EE63-4233-B62D-7C00FD30783D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"63df7153432d81fa42019fcabb076c89649b0b5b","datavalue":{"value":{"time":"+1986-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1819702$CFD3D401-7627-4ACF-8359-DAA9F694C55E","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"b33b78a78302906d20ef4a715ff7c089a5e477c3","datavalue":{"value":"We consider the problem of optimal combinations of priority scheduling rules. A polynomial algorithm is proposed for finding an optimal combination of static priorities in the three-machine problem, polynomial algorithms with a bound are given for the m-machine problem, and some results concerning the choice of the set of static priorities are presented. It is shown that finding an optimal combination of dynamic priorities in a weighted one-machine problem is a polynomially complete problem.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1819702$1B39159C-2619-471F-8D75-B80C60E02FC3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b7ffcab9ce53e90c8627cb2c3bb400b94a5f354a","datavalue":{"value":"90B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1819702$B55E0056-8EC4-4E30-B633-4B9FEA1BC5E6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1819702$F2BC6118-F9DA-4E7E-A7A5-BB38AEF90306","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6a34d46b6655b7489472bbff9e48a446d5aef6c2","datavalue":{"value":"3993284","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1819702$E60AEEB4-E85A-4997-A613-2B9E258F8513","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"034e7cdf299dedbfd739d740422c41eed0bfeaaa","datavalue":{"value":"optimal combinations of priority scheduling","type":"string"},"datatype":"string"},"type":"statement","id":"Q1819702$199EDCF5-8F4A-434F-8B0A-0775AB21D463","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fc544e482aa599702c82d69a25709014b297742d","datavalue":{"value":"polynomial algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1819702$65E3FB7B-9925-4250-8B38-03298F7E1742","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":"Q1819702$C3731B3F-DE8E-49A4-A01A-8DA942672E45","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"50c46748e7273439ba877eca838e0317dd499382","datavalue":{"value":{"entity-type":"item","numeric-id":3770268,"id":"Q3770268"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"37ccc4816eff7a5aa386d01f6cf35706c17a96e5","datavalue":{"value":{"amount":"+0.8025307655334473","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1819702$1CA3847C-FCD6-4C9E-B9B8-1795E4AC6AA0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"823c11f5986ebdec892d9e17fb79ebc8c1a16dbd","datavalue":{"value":{"entity-type":"item","numeric-id":1111923,"id":"Q1111923"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"77103da4c6717d8298c41bd7d20b7a8b33525526","datavalue":{"value":{"amount":"+0.789209246635437","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1819702$B9363CCE-C0FC-4D0F-AA03-358ECE2FB134","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fcdef955be95e887355f9da7fbff3bdc4425dd18","datavalue":{"value":{"entity-type":"item","numeric-id":3827790,"id":"Q3827790"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5d618a4e8076182267c5a7e397caedb8c74ba48d","datavalue":{"value":{"amount":"+0.7842335104942322","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1819702$9D5DF9E3-7606-47F2-82B8-9A0EAEE233CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e257eebfd496e03a2f75c5f3689a07282a7f5fc0","datavalue":{"value":{"entity-type":"item","numeric-id":3339651,"id":"Q3339651"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"7efd57e8a6d4f9188a3058f7ad7b3f9b4990ca33","datavalue":{"value":{"amount":"+0.7802466154098511","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1819702$A3597438-92F9-4FAB-9C2F-0B95644542C3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5ef43706fd0d5b568a8f37bb1b352e477dbb1d0d","datavalue":{"value":{"entity-type":"item","numeric-id":2638924,"id":"Q2638924"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1acb0a11b9eea3cbc1539e0abaa35708564e3b7d","datavalue":{"value":{"amount":"+0.7747112512588501","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1819702$021AEA4A-66C4-4F78-BE36-3EB9D0901254","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimal combinations of priority scheduling rules","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Optimal_combinations_of_priority_scheduling_rules"}}}}}