{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:37:07Z","timestamp":1761597427465},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/tase.2013.2259816","type":"journal-article","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T18:25:10Z","timestamp":1369160710000},"page":"757-771","source":"Crossref","is-referenced-by-count":17,"title":["Solving assembly scheduling problems with tree-structure precedence constraints: A Lagrangian relaxation approach"],"prefix":"10.1109","volume":"10","author":[{"given":"Jingyang","family":"Xu","sequence":"first","affiliation":[]},{"given":"Rakesh","family":"Nagi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(87)90243-8"},{"key":"ref30","author":"rardin","year":"1998","journal-title":"Optimization in Operations Research"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.08.015"},{"key":"ref11","author":"ovacik","year":"1996","journal-title":"Decomposition Methods for Complex Factory Scheduling Problems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1504\/IJISE.2006.009059"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-008-1608-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-009-0238-1"},{"key":"ref15","author":"pinedo","year":"2008","journal-title":"Scheduling Theory Algorithms and Systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.01.046"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.5.1114"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/37.45792"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/70.210791"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90255-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.34.3.391"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"lenstra","year":"1977","journal-title":"Ann Discrete Math"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90204-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-008-0004-5"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"3344","DOI":"10.1016\/j.cor.2005.03.028","article-title":"A new Lagrangian relxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time","volume":"33","author":"tang","year":"2006","journal-title":"Comput Oper Res"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.02.024"},{"key":"ref8","first-page":"2578","article-title":"An efficient job shop scheduling algorithm based on artificial bee colony","volume":"5","author":"yin","year":"2011","journal-title":"Sci Res Essays"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.08.145"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.35.2.164"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.007"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1080\/15458830.1996.11770710","article-title":"?Just-in-time? production of large assemblies","volume":"28","author":"agrawal","year":"1996","journal-title":"IIE Trans"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/70.282535"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.04.008"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/07408179808966565"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00470-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022646725208"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-007-9349-z"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.05.009"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/6549150\/06517989.pdf?arnumber=6517989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:38:45Z","timestamp":1638218325000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6517989\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":31,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tase.2013.2259816","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}