{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T19:08:55Z","timestamp":1725304135448},"reference-count":22,"publisher":"Fuji Technology Press Ltd.","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJAT","Int. J. Automation Technol."],"published-print":{"date-parts":[[2020,1,5]]},"abstract":"Completely automated assembly sequence planning for control panels is proposed. The proposed algorithm generates the manufacturing bill of material for the assembly processes and total assembly sequence. The algorithm integrates the knowledge of assembly process into a near optimum assembly sequence generation.<\/jats:p>","DOI":"10.20965\/ijat.2020.p0006","type":"journal-article","created":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T15:02:07Z","timestamp":1578150127000},"page":"6-17","source":"Crossref","is-referenced-by-count":3,"title":["Process Knowledge Integrated Assembly Sequence Planning for Control Panel"],"prefix":"10.20965","volume":"14","author":[{"given":"Atsuko","family":"Enomoto","sequence":"first","affiliation":[]},{"given":"Noriaki","family":"Yamamoto","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Yamamura","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Sugawara","sequence":"additional","affiliation":[]},{"name":"Research & Development Group, Hitachi, Ltd. 292 Yoshidacho, Totsuka-ku, Yokohama-shi, Kanagawa 244-0817, Japan","sequence":"additional","affiliation":[]},{"name":"Insight Group, Control System Platform Division, Omika Works, Hitachi, Ltd., Hitachi, Japan","sequence":"additional","affiliation":[]}],"member":"8550","published-online":{"date-parts":[[2020,1,5]]},"reference":[{"key":"key-10.20965\/ijat.2020.p0006-1","doi-asserted-by":"crossref","unstructured":"L. S. H. de Mello and A. C. Sanderson, \u201cAND\/OR graph representation of Assembly plans,\u201d IEEE Trans. Robotics Automat., Vol.6, No.2, pp. 188-199, 1990.","DOI":"10.1109\/70.54734"},{"key":"key-10.20965\/ijat.2020.p0006-2","doi-asserted-by":"crossref","unstructured":"L. S. H. de Mello and A. C. Sanderson, \u201cA Correct and Complete Algorithm for the Generation of Mechanical Assembly Sequences,\u201d IEEE Trans. of Robotics and Automation, Vol.7, Issue 2, pp. 228-240, 1991.","DOI":"10.1109\/70.75905"},{"key":"key-10.20965\/ijat.2020.p0006-3","doi-asserted-by":"crossref","unstructured":"T. de Fazio and D. Whitney, \u201cSimplified Generation of All Mechanical Assembly Sequence,\u201d IEEE J. of Robotics and Automation, Vol.3, Issue 6, 1987.","DOI":"10.1109\/JRA.1987.1087132"},{"key":"key-10.20965\/ijat.2020.p0006-4","doi-asserted-by":"crossref","unstructured":"V. N. Rajan and S. Y. Nof, \u201cMinimal Precedence Constraints for Integrated Assembly and Execution Planning,\u201d IEEE Trans. on Robotics and Automation, Vol.12, Issue 2, pp. 175-186, 1996.","DOI":"10.1109\/70.488939"},{"key":"key-10.20965\/ijat.2020.p0006-5","unstructured":"T. Kanehara, T. Suzuki, A. Inaba, and S. Okuma, \u201cOn algebraic and graph structural properties of assembly Petri net,\u201d Proc. 1993 IEEE\/RSJ Int. Conf. on Intelligent Robotics and Systems, Yokohama, Japan, pp. 2286-2293, 1993."},{"key":"key-10.20965\/ijat.2020.p0006-6","doi-asserted-by":"crossref","unstructured":"A. J. D. Lambert, \u201cLinear programming in disassembly\/clustering sequence generation,\u201d Computer & Industrial Engineering, Vol.36, pp. 723-738, 1999.","DOI":"10.1016\/S0360-8352(99)00162-X"},{"key":"key-10.20965\/ijat.2020.p0006-7","unstructured":"A. J. D. Lambert, \u201cAutomatic determination of transition matrices in optimal disassembly sequence generation,\u201d Proc. 4th 2001 IEEE Int. Symp. on Assembly and Task Planning, Fukuoka, Japan, pp. 220-225, 2001."},{"key":"key-10.20965\/ijat.2020.p0006-8","doi-asserted-by":"crossref","unstructured":"A. J. D. Lambert, \u201cDetermining optimum disassembly sequence in electronic equipment,\u201d Computer & Industrial Engineering, Vol.43, pp. 553-575, 2002.","DOI":"10.1016\/S0360-8352(02)00125-0"},{"key":"key-10.20965\/ijat.2020.p0006-9","unstructured":"A. Schrijver, \u201cCombinatorial Optimization: Polyhedra And Efficiency,\u201d Springer, 2003."},{"key":"key-10.20965\/ijat.2020.p0006-10","doi-asserted-by":"crossref","unstructured":"Y. Wang and D. Tian, \u201cA weighted assembly precedence graph for assembly sequence planning,\u201d Int. J. Adv. Manuf. Technol., Vol.83, pp. 99-115, 2016.","DOI":"10.1007\/s00170-015-7565-5"},{"key":"key-10.20965\/ijat.2020.p0006-11","unstructured":"C. Sinanoglu, \u201cDesign of an artificial neural network for assembly sequence planning system,\u201d Int. J. of Industrial. Eng., Vol.15, No.1, pp. 92-103, 2008."},{"key":"key-10.20965\/ijat.2020.p0006-12","doi-asserted-by":"crossref","unstructured":"Y. Wang and J. H. Liu, \u201cChaotic particle swarm optimization for assembly sequence planning,\u201d Robotics and Computer-Integrated Manufacturing, Vol.26, Issue 2, pp. 212-222, 2010.","DOI":"10.1016\/j.rcim.2009.05.003"},{"key":"key-10.20965\/ijat.2020.p0006-13","unstructured":"Q. Guan, J. H. Liu, and Y. F. Zhong, \u201cA concurrent hierarchical evolution approach to assembly process planning,\u201d Int. J. of Production Research, Vol.40, Issue 14, pp. 3357-3374, 2002."},{"key":"key-10.20965\/ijat.2020.p0006-14","unstructured":"D. Agrawal, P. T. Nallamothu, S. R. Mandala, S. Kumara, and D. A. Finke, \u201cAutomated disassembly sequence planning and optimization,\u201d Proc. of the 2013 Industrial and System Engineering Research Conf., pp. 122-131, 2013."},{"key":"key-10.20965\/ijat.2020.p0006-15","unstructured":"C. Zeng, T. Gu, L. Chang, and F. Li, \u201cA novel multi-agent evolutionary algorithm for assembly sequence planning,\u201d J. of Software, Vol.8, No.6, pp. 1518-1525, 2013."},{"key":"key-10.20965\/ijat.2020.p0006-16","unstructured":"A. T. Mathew and C. S. Rao, \u201cImplementation of genetic algorithm to optimize the assembly sequence plan based on penalty function,\u201d ARPN J. of Engineering and Applied Sciences, Vol.9, No.4, pp. 453-456, 2014."},{"key":"key-10.20965\/ijat.2020.p0006-17","unstructured":"X. Niu, H. Ding, and Y. Xiong, \u201cA hierarchical approach to generating precedence graphs for assembly planning,\u201d Int. J. of Machine Tools & Manufacture, Vol.43, Issue 14, pp. 1473-1486, 2003."},{"key":"key-10.20965\/ijat.2020.p0006-18","doi-asserted-by":"crossref","unstructured":"T. Murayama, B. Takemura, and F. Oba, \u201cAssembly Sequence Planning Using Inductive Learning,\u201d J. Robot. Mechatron., Vol.11, No.4, pp. 315-320, 1999.","DOI":"10.20965\/jrm.1999.p0315"},{"key":"key-10.20965\/ijat.2020.p0006-19","doi-asserted-by":"crossref","unstructured":"A. Enomoto, Y. Aoyama, Y. Yamauchi, and N. Yamamoto, \u201cNear optimal assembly sequence generation,\u201d Proc. of Int. Symp. on System and Integration, Sapporo, Japan, pp. 95-101, 2016.","DOI":"10.1109\/SII.2016.7843981"},{"key":"key-10.20965\/ijat.2020.p0006-20","unstructured":"A. Enomoto, N. Yamamoto, Y. Yamamura, and Y. Sugawara, \u201cAssembly sequence planning for control panel with flexible wiring components,\u201d 17th Int. Conf. on Precision Engineering (ICPE2018), A-1-1, 2018."},{"key":"key-10.20965\/ijat.2020.p0006-21","doi-asserted-by":"crossref","unstructured":"D. B. Johnson, \u201cA Note on Dijkstra\u2019s Shortest Path Algorithm,\u201d J. of the ACM (JACM), Vol.20, Issue 3, pp. 385-388, 1973.","DOI":"10.1145\/321765.321768"},{"key":"key-10.20965\/ijat.2020.p0006-22","unstructured":"https:\/\/en.cppreference.com\/w\/cpp\/algorithm\/sort [Accessed December 17, 2019]"}],"container-title":["International Journal of Automation Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.fujipress.jp\/main\/wp-content\/themes\/Fujipress\/phyosetsu.php?ppno=IJATE001400010001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T15:02:15Z","timestamp":1578150135000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.fujipress.jp\/ijat\/au\/ijate001400010006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,5]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1,5]]},"published-print":{"date-parts":[[2020,1,5]]}},"URL":"https:\/\/doi.org\/10.20965\/ijat.2020.p0006","relation":{},"ISSN":["1883-8022","1881-7629"],"issn-type":[{"type":"electronic","value":"1883-8022"},{"type":"print","value":"1881-7629"}],"subject":[],"published":{"date-parts":[[2020,1,5]]}}}