{"entities":{"Q2224056":{"pageid":2234799,"ns":120,"title":"Item:Q2224056","lastrevid":71604075,"modified":"2026-04-13T23:21:07Z","type":"item","id":"Q2224056","labels":{"en":{"language":"en","value":"Comparative analysis of swarm intelligence and heuristic priority rules for solving multi-project scheduling problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7305357"}},"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":"Q2224056$6557934E-D2FD-47D6-AEB7-78AB91C621A7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"eb394646d6d288a814d003559bafe33b1839a34b","datavalue":{"value":{"text":"Comparative analysis of swarm intelligence and heuristic priority rules for solving multi-project scheduling problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2224056$2596068F-8E05-447A-9DB3-E8B2BC39CFBD","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"3a6d2e2941fcbedb1c9105b5be7f6546e0668dab","datavalue":{"value":"1453.90069","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224056$2BB9EBF7-49AE-42A8-9843-6F7560B8A879","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c1e81f50eb10b18e5c46e844ffa6fc2365eec900","datavalue":{"value":"10.1504/IJCSM.2015.073597","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224056$BB6D41C3-6AFF-4194-A25F-9CC5EBEB19CB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a920b91f20e08d449d483f1069d01db70b1ef0cf","datavalue":{"value":{"entity-type":"item","numeric-id":258568,"id":"Q258568"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2224056$AE1759BF-4479-4CE0-92A5-9DE9214E5B34","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f7c57c73402564af08e7abf2781976d8b63efbd8","datavalue":{"value":{"entity-type":"item","numeric-id":444284,"id":"Q444284"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2224056$B14C90A5-0F06-4FD6-996C-283E63AE3261","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f306f7a0701f0c426c5681c314795b1e314a5dc6","datavalue":{"value":{"entity-type":"item","numeric-id":391694,"id":"Q391694"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2224056$DECCE4A2-A2A6-44D8-A865-33004363B76B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a4fdcf569a0845156edf00801a6025e0e3cf1d2e","datavalue":{"value":{"time":"+2021-02-03T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2224056$9F14D378-0D1C-4E01-B492-D55EBCFEA1F2","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"9c580d56c8566b80717e59d7ad6e268cc3a8636a","datavalue":{"value":"Summary: Multi-project management is very complex task, which often involves the integration of varieties of resources and schedules. In recent years, many researchers have proposed many techniques for project scheduling problems. However, due to its complexity, it is difficult to find out the best scheduling scheme using heuristics or non-traditional techniques. In this paper, the aim is to find out the high-performance algorithms to solve combination optimisation problems. Related comparative analysis of swarm intelligence and heuristic priority rules for scheduling a multi-project environment with an objective to minimise the makespan of the projects is explored. Firstly, the multi-mode resource constrained multi-project scheduling problem (MRCMPSP) and its conceptual model are proposed. Then, swarm intelligence and heuristic priority rules to the MRCMPSP problem are discussed. Thirdly, the simulation experiments are given in order to test the different searching abilities for various scale scheduling problems using these two methods. Finally, some interesting insights are also illustrated through numerical examples.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224056$1F2FEABA-6DE0-4918-BC5B-F3FC2DCDBF2B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b7ffcab9ce53e90c8627cb2c3bb400b94a5f354a","datavalue":{"value":"90B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224056$53988874-735C-4719-96E2-89728E9D5C68","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8d42ae7884b9335550c4d21f090798ce9c56a9bf","datavalue":{"value":"90C59","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224056$1495A377-C3A9-43E0-A84D-08E19155A91E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e2ee4eedd08d08350843eaf2d2a24cb34503c3a1","datavalue":{"value":"7305357","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2224056$E0D9C04D-585C-44FD-82C1-0DA221BCCF93","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d753e5e990ebfdf83a949c3aaffa7801d2f62688","datavalue":{"value":"resource constraints","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224056$7185258B-FEC6-4AC9-AE1B-2DAC6C42FB81","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d6c1db3cc7d579ef41ff55d5cf9a30056bc5b45b","datavalue":{"value":"multi-project scheduling","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224056$7BCE4496-0D49-49C5-9747-7BD014B40192","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e52a9c701bf2c4e0aa3262801ca1ecb9609c5809","datavalue":{"value":"swarm intelligence","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224056$28596708-2BD2-49BB-9EF2-533F3E224299","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f01f6d2bc7716a165f8f17caaf7ad5dbafc98021","datavalue":{"value":"heuristic priority rules","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224056$7E804F5D-FA95-4E85-8A2E-97A1D4A3B1E3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bf278915d4d4f21655cb6bd3337393847203f8a5","datavalue":{"value":"makespan","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224056$BF28410E-A02C-49E2-94D1-995A073D27E4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f828563fee5a57e5f16da87a79378ac587cea3ac","datavalue":{"value":"simulation","type":"string"},"datatype":"string"},"type":"statement","id":"Q2224056$0146962A-4E64-47A6-A0E1-531EF7819783","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":"Q2224056$A3EF6942-D960-407D-9F52-610E767C1FE9","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f3510ada4598ab6f41dc3199ad849c255b590af7","datavalue":{"value":{"entity-type":"item","numeric-id":444285,"id":"Q444285"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"994e9b3af84e1e93914f8d8ae802be564bc4e7d0","datavalue":{"value":{"amount":"+0.8110236525535583","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":"Q2224056$37A37B6F-95BB-486B-8D73-520C1417B6D7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d9d953e75a251ff4b406b06c8e0400078c14a34a","datavalue":{"value":{"entity-type":"item","numeric-id":2928436,"id":"Q2928436"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"7487e256d67f4c71c0703ed7c7e6a1f22489c241","datavalue":{"value":{"amount":"+0.7927988767623901","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":"Q2224056$E99B9EDD-C898-44BF-BBB3-3C3B5360D845","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"060de00f2d10aa254717b2dc1b14018325f12f0a","datavalue":{"value":{"entity-type":"item","numeric-id":5948204,"id":"Q5948204"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a88e76882a0840625ed64ad00b9fae9e3593383d","datavalue":{"value":{"amount":"+0.7842955589294434","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":"Q2224056$7FC091AF-EB6E-4625-997E-CE4786F1AE6D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"515fb0c8dac37d1aeabdb443ce6f55a2d9793dd2","datavalue":{"value":{"entity-type":"item","numeric-id":3072899,"id":"Q3072899"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5939f34f221ff8fd1abe6d94878c98c4d308c4b4","datavalue":{"value":{"amount":"+0.7795670032501221","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":"Q2224056$7F793B30-F3B3-485E-8F51-0876F3690F1A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3f47608ed1332bcf570744af604f11b404487fde","datavalue":{"value":{"entity-type":"item","numeric-id":5964346,"id":"Q5964346"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4a8ccce453fe57edffbf5d29a6ba944c9231fa91","datavalue":{"value":{"amount":"+0.7791739106178284","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":"Q2224056$C6D9493B-34C4-4079-A168-8FF9CA424194","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Comparative analysis of swarm intelligence and heuristic priority rules for solving multi-project scheduling problem","badges":[]}}}}}