{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:50:32Z","timestamp":1649213432865},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0377-2217(97)00381-0","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"147-157","source":"Crossref","is-referenced-by-count":4,"title":["A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs"],"prefix":"10.1016","volume":"112","author":[{"given":"Taichi","family":"Kaji","sequence":"first","affiliation":[]},{"given":"Azuma","family":"Ohuchi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0377-2217(97)00381-0_BIB1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/321623.321627","article-title":"Optimal sequential partitions of graphs","volume":"18","author":"Kernighan","year":"1971","journal-title":"Journal of ACM"},{"issue":"8","key":"10.1016\/S0377-2217(97)00381-0_BIB2","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/mnsc.32.8.909","article-title":"A survey of exact algorithms for the simple assembly line balancing problem","volume":"32","author":"Baybars","year":"1986","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00381-0_BIB3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0167-188X(89)90023-2","article-title":"A method for assembly line balancing","volume":"18","author":"Betts","year":"1989","journal-title":"Engineering Costs and Production Economics"},{"key":"10.1016\/S0377-2217(97)00381-0_BIB4","doi-asserted-by":"crossref","unstructured":"K. Fujisawa, M. Kubo, S. Morito, An application of tabu search to the graph partitioning problem, The Transactions of the Institute of Electrical Engineers of Japan 114-C (4) (1994) 430\u2013437","DOI":"10.1541\/ieejeiss1987.114.4_430"},{"issue":"3","key":"10.1016\/S0377-2217(97)00381-0_BIB5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search, Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"issue":"1","key":"10.1016\/S0377-2217(97)00381-0_BIB6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search, Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(97)00381-0_BIB7","unstructured":"C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems, Blackwell, Oxford, 1993"},{"key":"10.1016\/S0377-2217(97)00381-0_BIB8","doi-asserted-by":"crossref","unstructured":"T. Kaji, A. Ohuchi, A tabu search approach to the optimal sequential partitions of directed acyclic graphs, The Transactions of the Institute of Electrical Engineers of Japan 116-C (10) (1996) 1149\u20131157","DOI":"10.1541\/ieejeiss1987.116.10_1149"},{"key":"10.1016\/S0377-2217(97)00381-0_BIB9","doi-asserted-by":"crossref","unstructured":"T. Kaji, A. Ohuchi, Assignment problem for system with precedence relation among elements, The Transactions of the Institute of Electrical Engineers of Japan 117-C (2) (1997) 136\u2013142","DOI":"10.1541\/ieejeiss1987.117.2_136"},{"key":"10.1016\/S0377-2217(97)00381-0_BIB10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01022991","article-title":"A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem","volume":"50","author":"Aarts","year":"1988","journal-title":"Journal of Statistical Physics"},{"key":"10.1016\/S0377-2217(97)00381-0_BIB11","doi-asserted-by":"crossref","unstructured":"E. Aarts, J. Korst, Simulated annealing and Boltzmann machines, Wiley, NY, 1989","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"key":"10.1016\/S0377-2217(97)00381-0_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02242185","article-title":"A simulated annealing approach to the multiconstraint zero\u2013one knapsack problem","volume":"40","author":"Drexl","year":"1988","journal-title":"Computing"},{"issue":"6","key":"10.1016\/S0377-2217(97)00381-0_BIB13","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: An experimental evaluation, Part I, Graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00381-0_BIB14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","article-title":"Ejection chains, reference structures and alternating path methods for traveling salesman problems","volume":"65","author":"Glover","year":"1996","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"10.1016\/S0377-2217(97)00381-0_BIB15","first-page":"364","article-title":"Development and characteristic analysis of branch-and-bound algorithm for optimal sequential partitions of graphs","volume":"35","author":"Kaji","year":"1994","journal-title":"Transactions of Information Processing Society of Japan"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003810?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003810?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T23:43:24Z","timestamp":1578872604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797003810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0377221797003810"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00381-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}