{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T01:05:03Z","timestamp":1785546303543,"version":"3.56.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0305-0548(01)00054-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"1759-1772","source":"Crossref","is-referenced-by-count":49,"title":["Connections between cutting-pattern sequencing, VLSI design, and flexible machines"],"prefix":"10.1016","volume":"29","author":[{"given":"Alexandre","family":"Linhares","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Horacio Hideki","family":"Yanasse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(01)00054-5_BIB1","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/S0377-2217(97)84107-0","article-title":"On a pattern sequencing problem to minimize the maximum number of open stacks","volume":"100","author":"Yanasse","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB2","series-title":"Algorithmic graph theory and perfect graphs.","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB3","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-parameter tractability and completeness. 1. Basic results","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0305-0548(98)80001-4","article-title":"Applications of modern heuristic search methods to pattern sequencing problems","volume":"26","author":"Fink","year":"1999","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB5","unstructured":"Kashiwabara T, Fujisawa T. NP-completeness of the problem of finding a minimum clique number interval graph containing a given graph as a subgraph. Proceedings of the 1979 IEEE International Symposium on Circuits and Systems, Tokyo, Japan, July 1979. p. 657\u201360."},{"key":"10.1016\/S0305-0548(01)00054-5_BIB6","first-page":"17","article-title":"Graph problems related to gate matrix layout and PLA folding","volume":"7","author":"M\u00f6hring","year":"1990","journal-title":"Computing"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB7","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1109\/TCS.1979.1084695","article-title":"One-dimensional logic gate assignment and interval graphs","volume":"26","author":"Ohtsuki","year":"1979","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB8","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/TCAD.1985.1270118","article-title":"Gate matrix layout","volume":"4","author":"Wing","year":"1985","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","article-title":"Interval graphs and searching","volume":"55","author":"Kirousis","year":"1985","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","article-title":"Searching and pebbling","volume":"47","author":"Kirousis","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(92)90208-R","article-title":"Narrowness, pathwidth, and their application in natural language processing","volume":"36","author":"Kornai","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0166-218X(97)00131-5","article-title":"Helicopter search problems, bandwdith and pathwidth","volume":"85","author":"Fomin","year":"1998","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB13","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","article-title":"The vertex separation number of a graph equals its path-width","volume":"42","author":"Kinnersley","year":"1992","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB14","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF00264496","article-title":"Black and White peebles and graph separation","volume":"16","author":"Lengauer","year":"1981","journal-title":"Acta Informatica"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(87)90054-8","article-title":"Nonconstructive advances in polynomial-time complexity","volume":"26","author":"Fellows","year":"1987","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01324874","article-title":"Minimizing the number of tool switches on a flexible machine","volume":"6","author":"Crama","year":"1994","journal-title":"International Journal of Flexible Manufacturing Systems"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB17","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1080\/07408178808966195","article-title":"A heuristic for minimizing the number of tool switches on a flexible machine","volume":"20","author":"Bard","year":"1988","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB18","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/opre.36.5.767","article-title":"Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches","volume":"36","author":"Tang","year":"1988","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB19","series-title":"Computers and intractability.","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1057\/jors.1988.42","article-title":"An application of travelling salesman routines to solve pattern allocation problems in the glass industry","volume":"39","author":"Madsen","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TCAD.1987.1270248","article-title":"Exact and approximate solutions for the gate matrix layout problem","volume":"6","author":"Deo","year":"1987","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB22","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/S0377-2217(97)00268-3","article-title":"Heuristic and exact methods for the cutting sequencing problem","volume":"110","author":"Faggioli","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB23","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00257-9","article-title":"Simulated annealing for order spread minimization in sequencing cutting patterns","volume":"110","author":"Foerster","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB24","doi-asserted-by":"crossref","first-page":"1750","DOI":"10.1109\/43.811324","article-title":"Linear gate assignment: a fast statistical mechanics approach","volume":"18","author":"Linhares","year":"1999","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB25","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0925-5273(99)00055-9","article-title":"A new heuristic based on a hypergraph representation for the tool switching problem","volume":"64","author":"Djellab","year":"2000","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0305-0548(01)00054-5_BIB26","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1109\/43.57791","article-title":"GM_Plan: a gate matrix layout algorithm based on artificial intelligence planning techniques","volume":"9","author":"Hu","year":"1990","journal-title":"IEEE Transactions on Computer-Aided Design"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000545?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000545?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:23:03Z","timestamp":1555118583000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054801000545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":26,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0305054801000545"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(01)00054-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}