{"entities":{"Q492474":{"pageid":494241,"ns":120,"title":"Item:Q492474","lastrevid":62247177,"modified":"2026-04-11T04:46:55Z","type":"item","id":"Q492474","labels":{"en":{"language":"en","value":"Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6474157"}},"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":"Q492474$676372F1-5C00-4CEB-BD51-3B891F653B8D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f125b6841742e4bcd8955a05c36664e3a36b4a8d","datavalue":{"value":{"text":"Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q492474$192F7DC8-87F2-4BA8-AF26-A78790C58F0D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"df95d85d70599ff7c283d4349bd1822354912e34","datavalue":{"value":"1327.90071","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q492474$4495AF4E-FEFD-4F1E-8B5B-1C8A43280C4E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8adccf3ea482d06eeb25762baeed1ee925185cc6","datavalue":{"value":"10.1134/S106456240701036X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q492474$7F561FBC-2A90-4699-A5A3-51B19B45856F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4ca4811b5a017f1f37af6a345468f98b2693ddb5","datavalue":{"value":{"entity-type":"item","numeric-id":483268,"id":"Q483268"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q492474$F2F4EA1E-D5C7-46C8-B3DE-45A33F327B9D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5f9c80f4d51ec1431372727f4e43ab1e2538a7a0","datavalue":{"value":{"entity-type":"item","numeric-id":492473,"id":"Q492473"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q492474$8172B821-F500-4BE6-83DE-75514765D3E6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2deb57a21cb059006d12126715dc580842ce5c7b","datavalue":{"value":{"entity-type":"item","numeric-id":367637,"id":"Q367637"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q492474$5CB3376A-6BD8-43B4-9AC6-3418FCC0D148","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"2bbc31fcaa3dcf49d82403ba391044fdfb104e43","datavalue":{"value":{"entity-type":"item","numeric-id":161529,"id":"Q161529"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q492474$3F17E6B2-9FAC-41F5-9416-35188EE2119D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"8e39592c2ba32aeaf9bbb43265ec41a1bb013153","datavalue":{"value":{"time":"+2015-08-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q492474$C97D6C29-2F65-4027-8923-943751C3D499","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b7ffcab9ce53e90c8627cb2c3bb400b94a5f354a","datavalue":{"value":"90B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q492474$A51CD5BE-0BA3-4800-AFDC-DDACB9B4B667","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a075736dd24125fb22e78e1f01acbe15d48baf3f","datavalue":{"value":"90C60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q492474$C8B37BAA-BD24-4892-B43B-CE9F76FE460F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1908801a2431998085c7d582418a428f7e7f6658","datavalue":{"value":"68M20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q492474$8D0B6AD0-ADB6-49FA-B003-BEAC4442E1A1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q492474$61F0805B-BD0C-46E7-8D4F-6BBED36E480E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"461bd03ae279252f4b58f0a8ef95f7eb99807629","datavalue":{"value":"6474157","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q492474$100EA030-7B09-4C1E-8AB4-7CB6F75981AD","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":"Q492474$0DE98990-E9A2-4E3B-955B-72528BF00840","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Algorithms_for_solving_the_NP-hard_problem_of_minimizing_total_tardiness_for_a_single_machine"}}}}}