{"entities":{"Q1149374":{"pageid":1160123,"ns":120,"title":"Item:Q1149374","lastrevid":66713397,"modified":"2026-04-12T12:19:56Z","type":"item","id":"Q1149374","labels":{"en":{"language":"en","value":"On two-machine scheduling with release and due dates to minimize maximum lateness"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3709911"}},"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":"Q1149374$842FFB8E-F512-45FC-8E7D-A692795066B4","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"dde66c342b48e2e3ef8acba48128518a074ba41f","datavalue":{"value":{"text":"On two-machine scheduling with release and due dates to minimize maximum lateness","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1149374$B601E69F-C18B-49D7-8B4F-2E3BA5E01C21","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"6c290be340de80a2fa10542495baf26506e17813","datavalue":{"value":"0453.90043","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1149374$837C7B4D-8844-444F-893C-177328DD52BB","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"07c876e6223b6f7e45c6ea730b8b78c5772aad81","datavalue":{"value":{"entity-type":"item","numeric-id":260460,"id":"Q260460"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1149374$3B25F54A-5CD7-44D9-ADE4-B30725C7A49F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"56afe75e154439409929c71e0e459d1542811b6e","datavalue":{"value":{"time":"+1980-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":"Q1149374$94BFA826-C6AE-4C11-ACA6-EB194F274EDF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b7ffcab9ce53e90c8627cb2c3bb400b94a5f354a","datavalue":{"value":"90B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1149374$13FF360C-5AB4-4BC2-B8C1-0E77FDA405CE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1149374$D7711075-922F-4157-82AD-241A551F4506","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"47e0daefe5ab58b6de0042a5d4c3a70f5457fedc","datavalue":{"value":"3709911","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1149374$70870E92-0F65-4476-BCE3-51D7366C7657","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d18c3a3b475a083f2f344e7432956c28ceb00999","datavalue":{"value":"two-machine scheduling","type":"string"},"datatype":"string"},"type":"statement","id":"Q1149374$C6DF3062-EC89-4DA5-827D-52BA18F81DBA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"30b446249c70dedf3e1124b4159a2ae8999d3962","datavalue":{"value":"due dates","type":"string"},"datatype":"string"},"type":"statement","id":"Q1149374$B7417A32-EAF0-4767-AA6D-05A6E1A71B52","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bf54e2d199641bd16db964256732a9040fd52c2f","datavalue":{"value":"branch-and-bound algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1149374$AC0A45A9-F523-4BF1-AA4B-97D38DC98CDB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5f2a61d3c00fb71b81ccd6a2389ed725581f93e3","datavalue":{"value":"sequencing n jobs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1149374$A409893F-62FB-4395-8DC4-5B9669124446","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f23485a99b1ee74b08f58f9eddfceb0f9b3098f4","datavalue":{"value":"critical path concept","type":"string"},"datatype":"string"},"type":"statement","id":"Q1149374$652F5CB3-EA3C-49E8-99E5-590A1166C0F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f2547fe05fc38d862a3c0fa5dd3d72d33319bce3","datavalue":{"value":"computational experience","type":"string"},"datatype":"string"},"type":"statement","id":"Q1149374$A0768BDE-7561-459B-A490-29D663B1EB55","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8abbfbe6af4e5ffe94157e8a6cd97d66bd68bb3f","datavalue":{"value":"minimization of maximum lateness","type":"string"},"datatype":"string"},"type":"statement","id":"Q1149374$BFC8FE3B-95A0-42FB-A2F7-B26FDEEFE75E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1fdadf78f35fb16296cd1dad4147bd52b7a36b85","datavalue":{"value":"release dates","type":"string"},"datatype":"string"},"type":"statement","id":"Q1149374$7E1E1623-763E-4D87-B94E-FB2B68A32B26","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0cf1e389e4be372ba1cd68ff6466582e166db5eb","datavalue":{"value":{"entity-type":"item","numeric-id":1056670,"id":"Q1056670"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1149374$F95B0B29-573E-4940-AEEB-632FDF27A630","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":"Q1149374$2B79B154-AC00-4509-9176-F984AC845D63","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On two-machine scheduling with release and due dates to minimize maximum lateness","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_two-machine_scheduling_with_release_and_due_dates_to_minimize_maximum_lateness"}}}}}