{"entities":{"Q2321546":{"pageid":2332289,"ns":120,"title":"Item:Q2321546","lastrevid":78568706,"modified":"2026-05-06T11:54:26Z","type":"item","id":"Q2321546","labels":{"en":{"language":"en","value":"A constraint programming method for advanced planning and scheduling system with multilevel structured products"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7097792"}},"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":"Q2321546$DE1727F5-EB9E-40F6-9A8E-EFA3836FFADC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a52a4dc909138967317c0bd094519e7f6b910387","datavalue":{"value":{"text":"A constraint programming method for advanced planning and scheduling system with multilevel structured products","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2321546$9833DCA9-7723-4B55-BF8E-078DE84B9232","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c3a6809a0628847c09bcd74cdb4d4292ff20e8b5","datavalue":{"value":"1419.90021","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2321546$C6359C0C-929C-4DBB-9E50-E6A51E3CD2A5","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7d22c0aa3e5f46ef4f37d1933e29e66fb9913aa8","datavalue":{"value":"10.1155/2014/917685","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2321546$7FA5E819-C0E8-4515-BF47-D9EFE8A14D4B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c750e2f336fd14e47500c0f84cdf492092e8e67c","datavalue":{"value":{"entity-type":"item","numeric-id":1726974,"id":"Q1726974"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$EDAD7EA4-C9E2-4707-9A06-B5CAAAABD945","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9fb8fb2f76e9ce246362f316488cfdaeb6edd169","datavalue":{"value":{"entity-type":"item","numeric-id":2321544,"id":"Q2321544"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$41DF83C9-58AC-4D12-A98B-5CE76D39875D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2f3d4e07b4926839e3c43a171ad2688da366cba4","datavalue":{"value":{"entity-type":"item","numeric-id":2321545,"id":"Q2321545"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$0A8BCFBF-272E-453E-A40B-23E826D746AF","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"e5ea7bc024fe2946ca15646035f056e2ab96db7a","datavalue":{"value":{"entity-type":"item","numeric-id":169945,"id":"Q169945"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$3CA4CF0A-46DB-4F86-B49F-AAF15B200528","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c21f6f773503b951c39a43e888d8d232f7bcd1c5","datavalue":{"value":{"time":"+2019-08-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2321546$4EB597BC-83BC-46C2-88A6-6C793E163A3F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"b4582bf29ffaa85bef74c04bac4c88d6c5559739","datavalue":{"value":"Summary: This paper deals with the advanced planning and scheduling (APS) problem with multilevel structured products. A constraint programming model is constructed for the problem with the consideration of precedence constraints, capacity constraints, release time and due date. A new constraint programming (CP) method is proposed to minimize the total cost. This method is based on iterative solving via branch and bound. And, at each node, the constraint propagation technique is adapted for domain filtering and consistency check. Three branching strategies are compared to improve the search speed. The results of computational study show that the proposed CP method performs better than the traditional mixed integer programming (MIP) method. And the binary constraint heuristic branching strategy is more effective than the other two branching strategies.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2321546$4DB91ED5-561B-4526-8EAB-1249BEDC11CB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"810d660658648f9bc3138c1cd0aba8029bb9050c","datavalue":{"value":"90B06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2321546$773CD5A2-EADB-4073-9737-4BACCE644807","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4deee01162e0e48bd44917789b0fa061cef14daa","datavalue":{"value":"7097792","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2321546$5A0E0689-13F6-47A8-9AC0-F5DAE7B78139","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"72400ecde0dcf5b6bc77f522a1266aec46bde499","datavalue":{"value":"Q59038374","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2321546$863FAE35-88D8-4017-B19A-F5AED361028A","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":"Q2321546$0594D543-E93B-449B-8AB8-5ACAFCC1C9D7","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c84c3ed16c98f54590dda40e8f13eaa8e3ac263b","datavalue":{"value":"https://doi.org/10.1155/2014/917685","type":"string"},"datatype":"url"},"type":"statement","id":"Q2321546$E66E7AD9-060A-4764-AB53-A006ABA7EEDE","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a3c50216273e48526ee1146857c7e52f0fc8fbb5","datavalue":{"value":"W2064445653","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2321546$32A4DD04-070F-4E3D-96CA-6E12175770B0","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"23333ec8753bfbf9ab9f4e15cbf3e4c5dd29fb17","datavalue":{"value":{"entity-type":"item","numeric-id":1010253,"id":"Q1010253"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$A6C90B5E-72D5-4205-A768-6262C7A93369","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c78dcd6c890b28f88d3ab05cd6e8c8c7f4263d1b","datavalue":{"value":{"entity-type":"item","numeric-id":3159643,"id":"Q3159643"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$98ECE790-2A62-4C46-8679-1B962829B44B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"72a5b52563674236e96a9bc2bde31eb004511bab","datavalue":{"value":{"entity-type":"item","numeric-id":872302,"id":"Q872302"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$49C18FB7-9DC4-4EF2-9E1A-9CFB3B43BAB7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"cd54e6a17e0b6233c7e364d486dc4e12750ac0bf","datavalue":{"value":{"entity-type":"item","numeric-id":1046091,"id":"Q1046091"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$00ABF268-6635-40A2-98B4-76FFCB2C378D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"357c5102fe2c0df3553957c2de985f5eda9ecea4","datavalue":{"value":{"entity-type":"item","numeric-id":1991314,"id":"Q1991314"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$F9173F5B-35F4-4765-8334-FEBDC8BA07F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7516fc65ecac37755fe011fe1711991dc2a48599","datavalue":{"value":{"entity-type":"item","numeric-id":3184605,"id":"Q3184605"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$5392D70C-69BF-4D47-9AFF-6DC08DDF175E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ea0a95e9b83933f42a75d8bfb8250f03ad9739ad","datavalue":{"value":{"entity-type":"item","numeric-id":1807948,"id":"Q1807948"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$6307C014-2611-40C3-8290-A120A8B1F143","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"30caa34264c0890ed7d316e3c64dba8e16a9bc49","datavalue":{"value":{"entity-type":"item","numeric-id":940884,"id":"Q940884"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$CA412FC2-6DCD-4EFA-A794-D1DEE17E2D4D","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4f03db8a82110de7af7eb425c793c8985f9bc005","datavalue":{"value":{"entity-type":"item","numeric-id":872302,"id":"Q872302"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1a3c31b1d8ea29c2d1757c5e4ca1eb8ac744ace5","datavalue":{"value":{"amount":"+0.787555992603302","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":"Q2321546$DDE8924B-51D1-440F-A0F5-24CCDB477066","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"acbf747a91c1cc95a96f49747b90a7100d07fdfb","datavalue":{"value":{"entity-type":"item","numeric-id":1991314,"id":"Q1991314"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2e6422f0b2448e2f2b0f2717d141cb5274bbba00","datavalue":{"value":{"amount":"+0.7636941075325012","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":"Q2321546$D6954225-2031-49C6-B01C-BFC71DB2567C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1325dbd4b3fb3ef21b824914b87617db88b8fd68","datavalue":{"value":{"entity-type":"item","numeric-id":1850300,"id":"Q1850300"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ac1c72837561716c0b227f3268537bb3dc320425","datavalue":{"value":{"amount":"+0.7576523423194885","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":"Q2321546$2E9293A1-7C13-428E-B5BE-A9146BC577B0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"984f59c5456caadb8efff8cbf551e2e7ec6aace4","datavalue":{"value":{"entity-type":"item","numeric-id":850451,"id":"Q850451"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b85cb3436c454f460010d344d083677a5c66be9c","datavalue":{"value":{"amount":"+0.7325165271759033","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":"Q2321546$798A53C4-44BC-4BFC-A584-72CDAD9D67D5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3c082b83207cc1dc5b18e5ef77b316862b85d5bb","datavalue":{"value":{"entity-type":"item","numeric-id":5900301,"id":"Q5900301"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"006c00d934b8ac6d3645997a37805c7fbedbed2e","datavalue":{"value":{"amount":"+0.7297996878623962","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":"Q2321546$DC086791-EB6B-4CCA-9B3B-090721BF4DA3","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"daf5f856a5d861312ad309ab567540337a5f61d6","datavalue":{"value":{"entity-type":"item","numeric-id":57050,"id":"Q57050"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2321546$95ACDD12-66BD-4DB4-9CF2-34861938BBBB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A constraint programming method for advanced planning and scheduling system with multilevel structured products","badges":[]}}}}}