{"entities":{"Q6294745":{"pageid":13431123,"ns":120,"title":"Item:Q6294745","lastrevid":95113121,"modified":"2026-06-05T08:23:34Z","type":"item","id":"Q6294745","labels":{"en":{"language":"en","value":"A branch and bound algorithm for the robust parall machine scheduling"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900334340"}},"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":"Q6294745$0D497C5B-C0B7-406D-A200-6184F6DFA179","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c9608b634e159185ab81650af031ecc92744dbc0","datavalue":{"value":{"time":"+2017-12-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":"Q6294745$3D5CAA0C-A06C-4A95-A945-3395C49BA6BB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"44edb4a28f4b950f1d2ad070fe4a9f61a01c6b04","datavalue":{"value":{"entity-type":"item","numeric-id":6109394,"id":"Q6109394"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6294745$4E572B85-DD33-445A-BC77-DB63FE48375B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2e3ceb6e57f77508897beca99261b8dafe2c6125","datavalue":{"value":{"entity-type":"item","numeric-id":296711,"id":"Q296711"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6294745$3DF4932A-13BE-4D1A-A922-26126B6F195F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b915937a491c9813d3dd0d1ee1071681abe7784b","datavalue":{"value":"900334340","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6294745$09769D23-9D25-490D-B911-B8E9967E43E2","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":"Q6294745$F864094F-F3D1-4F5F-B133-4AD3DD7FB345","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A branch and bound algorithm for the robust parall machine scheduling","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_branch_and_bound_algorithm_for_the_robust_parall_machine_scheduling"}}}}}