{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T14:39:53Z","timestamp":1770475193291,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":[[2000,7]]},"DOI":"10.1016\/s0377-2217(99)00169-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:34:39Z","timestamp":1027650879000},"page":"409-421","source":"Crossref","is-referenced-by-count":57,"title":["Optimization of printed circuit board manufacturing: Integrated modeling and algorithms"],"prefix":"10.1016","volume":"124","author":[{"given":"Kemal","family":"Altinkemer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burak","family":"Kazaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murat","family":"K\u00f6ksalan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert","family":"Moskowitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0377-2217(99)00169-1_BIB1","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1287\/opre.36.2.176","article-title":"Component allocation and partitioning for a dual delivery placement machine","volume":"36","author":"Ahmadi","year":"1988","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(99)00169-1_BIB2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/opre.42.1.81","article-title":"Staging problem of a dual delivery pick-and-place machine in printed circuit card assembly","volume":"42","author":"Ahmadi","year":"1994","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(99)00169-1_BIB3","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.43.3.444","article-title":"Component fixture positioning for printed circuit board assembly with concurrent operations","volume":"43","author":"Ahmadi","year":"1995","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(99)00169-1_BIB4","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/trsc.24.4.294","article-title":"Heuristics for delivery problems with constant error guarantees","volume":"24","author":"Altinkemer","year":"1990","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/S0377-2217(99)00169-1_BIB5","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.39.3.456","article-title":"Parallel savings based heuristics for delivery problem","volume":"39","author":"Altinkemer","year":"1991","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(99)00169-1_BIB6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/07408179708966333","article-title":"Component allocation to balance workload in printed circuit card assembly systems","volume":"29","author":"Ammonds","year":"1997","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(99)00169-1_BIB7","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1002\/1520-6750(199408)41:5<587::AID-NAV3220410502>3.0.CO;2-Q","article-title":"Printed circuit board family grouping and component assignment for a multimachine, open-shop assembly cell","volume":"41","author":"Askin","year":"1994","journal-title":"Naval Research Logistics"},{"issue":"2","key":"10.1016\/S0377-2217(99)00169-1_BIB8","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/opre.36.2.192","article-title":"Sequencing of insertions in printed circuit board assembly","volume":"36","author":"Ball","year":"1988","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(99)00169-1_BIB9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","article-title":"Routing and scheduling of vehicles and crews the state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers and Operations Research"},{"issue":"6","key":"10.1016\/S0377-2217(99)00169-1_BIB10","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.39.6.992","article-title":"Routing printed circuit cards through an assembly cell","volume":"39","author":"Christopher","year":"1991","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(99)00169-1_BIB11","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1080\/07408178408974693","article-title":"On optimizing bin picking and insertion plans for assembly robots","volume":"16","author":"Drezner","year":"1984","journal-title":"IIE Transactions"},{"issue":"5","key":"10.1016\/S0377-2217(99)00169-1_BIB12","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/opre.42.5.846","article-title":"A branch and bound algorithm for the capacitated vehicle routing problem on directed graphs","volume":"42","author":"Fischetti","year":"1994","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(99)00169-1_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/S0377-2217(99)00169-1_BIB14","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","article-title":"Optimal solution of vehicle routing problems using minimum K-tree","volume":"42","author":"Fisher","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00169-1_BIB15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for vehicle routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00169-1_BIB16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","article-title":"Topological design of centralized computer networks: Formulations and algorithms","volume":"12","author":"Gavish","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00169-1_BIB17","unstructured":"Gavish, B., Seidmann, A., 1988. Printed circuit boards assembly automation \u2013 formulations and algorithms, In: Midal, A. (Ed.), Recent Developments in Production Research, Elsevier, Amsterdam, pp. 695\u2013717"},{"key":"10.1016\/S0377-2217(99)00169-1_BIB18","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(99)00169-1_BIB19","unstructured":"Kazaz, B., Altinkemer, K., 1999. Optimization of printed circuit board manufacturing: A multi-feeder assignment approach, Working Paper Series, 1999, Loyola University, Chicago, IL"},{"key":"10.1016\/S0377-2217(99)00169-1_BIB20","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","article-title":"Optimal routing under capacity and distance restrictions","volume":"33","author":"Laporte","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00169-1_BIB21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(89)90101-X","article-title":"Optimization of the movements of a component placement machine","volume":"38","author":"Leipala","year":"1989","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0377-2217(99)00169-1_BIB22","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1080\/07408179208964231","article-title":"Automated process planning for printed circuit card assembly","volume":"24","author":"McGinnis","year":"1992","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(99)00169-1_BIB23","unstructured":"McGinnis, L.F., Ammons, J.C., Tovey, C.A., 1993. Circuit card assembly process planning, In: Proceedings ASME Winter Annual Meeting, New Orleans, LA, November 29\u2013December 1, 1993"},{"issue":"1","key":"10.1016\/S0377-2217(99)00169-1_BIB24","first-page":"9","article-title":"Optimization issues in automated production of printed circuit boards: Operations sequencing and feeder configuration problems","volume":"8","author":"Or","year":"1996","journal-title":"Transactions on Operational Research"},{"key":"10.1016\/S0377-2217(99)00169-1_BIB25","unstructured":"Prasad, R.P., Mount surface technology. Von Nostrand Reinhold, New York, 1989"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001691?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001691?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T12:52:08Z","timestamp":1555246328000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799001691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0377221799001691"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00169-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}