{"entities":{"Q4776845":{"pageid":6806425,"ns":120,"title":"Item:Q4776845","lastrevid":74804721,"modified":"2026-04-15T00:25:39Z","type":"item","id":"Q4776845","labels":{"en":{"language":"en","value":"An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3453113"}},"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":"Q4776845$04E5741E-FCBA-4E15-AC77-302DD5549654","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0e565ea2b92b1b640ffab454f57a4718af3b3277","datavalue":{"value":{"text":"An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4776845$54BE7686-CCE9-4496-B3F4-26EB38622B35","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"1889e2a97a84aca305c8611ac253cbd9c634bb3e","datavalue":{"value":"0288.68026","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4776845$A574074D-4DEF-4186-95D6-4CA31423E9BF","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"65d3c5c556544f8b1bb10988120f9d51f6d1ed69","datavalue":{"value":"10.1109/T-C.1974.223825","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4776845$E7994E55-00FE-4C2A-A659-E1969BE2A6A6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ec4938b8309d1ff40223c2e448fe419038860e87","datavalue":{"value":{"entity-type":"item","numeric-id":4404687,"id":"Q4404687"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4776845$738D482D-5CBF-4617-ACF9-86664BE84EC2","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cb95ba1181f89055fe808aa2c36bea9d3930d0fc","datavalue":{"value":{"entity-type":"item","numeric-id":80442,"id":"Q80442"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4776845$F26D7339-DA74-4A4C-B8F6-6D3E368F180E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"718868df62fa29cb04609217d34e1254e53a40d9","datavalue":{"value":{"time":"+1974-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":"Q4776845$C1655B77-5E97-4C13-A292-B0D2773B0FBF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9b78776a56fc28cdd893baa47605a105412b838a","datavalue":{"value":"68Q45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4776845$9EACF410-54FA-452C-90D1-93092DD51B95","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b8e3f40e3cc87753c4e0b7d7ce4bdc00805f626f","datavalue":{"value":"68N01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4776845$68183CB3-FFDF-4EB0-A344-7150D290DBB6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4328c4207227e64a6a747cfa70fc0ad5c87e165a","datavalue":{"value":"3453113","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4776845$FBAD97E1-6CC5-472D-95DF-1A7AA2375BCA","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":"Q4776845$A19FAE6E-2AEF-44B1-B3B9-CF557BA8196C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_Almost-Optimal_Algorithm_for_the_Assembly_Line_Scheduling_Problem"}}}}}