{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:33:44Z","timestamp":1736573624155,"version":"3.32.0"},"reference-count":8,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T00:00:00Z","timestamp":1731110400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T00:00:00Z","timestamp":1731110400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11,9]]},"DOI":"10.1109\/scisisis61014.2024.10760223","type":"proceedings-article","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T18:35:23Z","timestamp":1733164523000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Faster Algorithms for a Lexicographic Bi-Criteria Line Balancing Problem with Totally Ordered Precedence Constraints"],"prefix":"10.1109","author":[{"given":"Shinji","family":"Imahori","sequence":"first","affiliation":[{"name":"Chuo University,Faculty of Science and Engineering,Tokyo,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiyuki","family":"Karuno","sequence":"additional","affiliation":[{"name":"Kyoto Institute of Technology,Faculty of Mechanical Engineering,Kyoto,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuma","family":"Ueda","sequence":"additional","affiliation":[{"name":"Graduate School of Science and Technology, Kyoto Institute of Technology,Mechanodesign Program,Kyoto,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.11.043"},{"volume-title":"Introduction to Algorithms","year":"2009","author":"Cormen","key":"ref2"},{"key":"ref3","first-page":"37","article-title":"An application of the linear partition to a lexicographic bi-criteria line balancing problem with related task groups","volume-title":"Proceedings of International Symposium on Scheduling 2015 (ISS 2015)","author":"Karuno","year":"2015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SII.2015.7404940"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00127358"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-014-5944-y"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-070-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1299\/jsmemecj.2014._s1410103-"}],"event":{"name":"2024 Joint 13th International Conference on Soft Computing and Intelligent Systems and 25th International Symposium on Advanced Intelligent Systems (SCIS&ISIS)","start":{"date-parts":[[2024,11,9]]},"location":"Himeji, Japan","end":{"date-parts":[[2024,11,12]]}},"container-title":["2024 Joint 13th International Conference on Soft Computing and Intelligent Systems and 25th International Symposium on Advanced Intelligent Systems (SCIS&ISIS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10759795\/10759863\/10760223.pdf?arnumber=10760223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T19:46:28Z","timestamp":1736538388000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10760223\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,9]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/scisisis61014.2024.10760223","relation":{},"subject":[],"published":{"date-parts":[[2024,11,9]]}}}