{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T10:58:11Z","timestamp":1762340291900},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,12,17]],"date-time":"2009-12-17T00:00:00Z","timestamp":1261008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s10951-009-0147-3","type":"journal-article","created":{"date-parts":[[2009,12,16]],"date-time":"2009-12-16T19:48:39Z","timestamp":1260992919000},"page":"177-202","source":"Crossref","is-referenced-by-count":36,"title":["Group-scheduling problems in electronics manufacturing"],"prefix":"10.1007","volume":"13","author":[{"given":"Cumhur A.","family":"Gelogullari","sequence":"first","affiliation":[]},{"given":"Rasaratnam","family":"Logendran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,17]]},"reference":[{"issue":"7","key":"147_CR1","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1287\/mnsc.40.7.868","volume":"40","author":"M.\u00a0M. Amini","year":"1994","unstructured":"Amini, M.\u00a0M., & Racer, M.\u00a0A. (1994). Rigorous computational comparison of alternative solution methods for the generalized assignment problem. Management Science, 40(7), 868\u2013890.","journal-title":"Management Science"},{"key":"147_CR2","volume-title":"ILOG Branch&Price&Cut and shortest path optimizers prototype manual","author":"Anon.","year":"2003","unstructured":"Anon. (2003). ILOG Branch&Price&Cut and shortest path optimizers prototype manual. Mountain View: Ilog Inc."},{"key":"147_CR3","volume-title":"ILOG CPLEX 9.0 reference manual","author":"Anon.","year":"2004","unstructured":"Anon. (2004a). ILOG CPLEX 9.0 reference manual. Mountain View: Ilog Inc."},{"key":"147_CR4","volume-title":"SAS: The SAS system for Windows","author":"Anon.","year":"2004","unstructured":"Anon. (2004b). SAS: The SAS system for Windows. Cary: SSAS Institute Inc."},{"issue":"3","key":"147_CR5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.47.3.395","volume":"47","author":"A. Balakrishnan","year":"1999","unstructured":"Balakrishnan,\u00a0A., & Vanderbeck,\u00a0F. (1999). A\u00a0tactical planning model for mixed-model electronics assembly operations. Operations Research, 47(3), 395\u2013409.","journal-title":"Operations Research"},{"key":"147_CR6","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart,\u00a0C., Johnson,\u00a0E., Nemhauser,\u00a0G., Savelsbergh,\u00a0M., & Vance,\u00a0P. (1998). Branch-and-Price: Column generation for solving huge integer programs. Operations Research, 46, 316\u2013329.","journal-title":"Operations Research"},{"key":"147_CR7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R.\u00a0S. Barr","year":"1995","unstructured":"Barr, R.\u00a0S., Golden, B.\u00a0L., Kelly, J.\u00a0P., Resende, M.\u00a0G.\u00a0C., & Stewart, W.\u00a0R. (1995). Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1, 9\u201332.","journal-title":"Journal of Heuristics"},{"key":"147_CR8","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1002\/nav.20000","volume":"51","author":"K. Bulbul","year":"2004","unstructured":"Bulbul,\u00a0K., Kaminsky,\u00a0P., & Yano,\u00a0C. (2004). Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs. Naval Research Logistics, 51, 407\u2013445.","journal-title":"Naval Research Logistics"},{"key":"147_CR9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"Z.\u00a0L. Chen","year":"1999","unstructured":"Chen, Z.\u00a0L., & Powell,\u00a0W. (1999). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing, 11, 78\u201394.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"147_CR10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/ijoc.12.1.24.11899","volume":"12","author":"M. Coffin","year":"2000","unstructured":"Coffin,\u00a0M., & Saltzman, M.\u00a0J. (2000). Statistical analysis of computational tests of algorithms and heuristics. INFORMS Journal on Computing, 12(1), 24\u201344.","journal-title":"INFORMS Journal on Computing"},{"key":"147_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0166-218X(01)00345-6","volume":"123","author":"Y. Crama","year":"2002","unstructured":"Crama,\u00a0Y., van\u00a0de Klundert, J.\u00a0J., & Spieksma, F.\u00a0C.\u00a0R. (2002). Production planning problems in printed circuit board assembly. Discrete Applied Mathematics, 123, 339\u2013361.","journal-title":"Discrete Applied Mathematics"},{"key":"147_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O. Merle du","year":"1999","unstructured":"du Merle,\u00a0O., Villeneuve,\u00a0D., Desrosiers,\u00a0J., & Hansen,\u00a0P. (1999). Stabilized column generation. Discrete Mathematics, 194, 229\u2013237.","journal-title":"Discrete Mathematics"},{"key":"147_CR13","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1007\/s001700200105","volume":"19","author":"D.\u00a0H. Eom","year":"2002","unstructured":"Eom, D.\u00a0H., Shin, H.\u00a0J., Kwun, I.\u00a0H., Shim, J.\u00a0K., & Kim, S.\u00a0S. (2002). Scheduling jobs on parallel machines with sequence-dependent family set-up times. International Journal on Advanced Manufacturing Technology, 19, 926\u2013932.","journal-title":"International Journal on Advanced Manufacturing Technology"},{"key":"147_CR14","first-page":"767","volume":"36","author":"M.\u00a0R. Garey","year":"1976","unstructured":"Garey, M.\u00a0R., Johnson, D.\u00a0S., & Sethi, R.\u00a0R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 36, 767\u2013777.","journal-title":"Mathematics of"},{"key":"147_CR15","unstructured":"Gelogullari, C.\u00a0A. (2005). Group scheduling problems in electronics manufacturing. Doctoral dissertation, Oregon State University, Corvallis, OR, USA."},{"key":"147_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover,\u00a0F., & Laguna,\u00a0M. (1997). Tabu search. Boston: Kluwer Academic."},{"key":"147_CR17","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1287\/mnsc.47.6.851.9813","volume":"47","author":"M. Gopalakrishnan","year":"2001","unstructured":"Gopalakrishnan,\u00a0M., Ding,\u00a0K., Bourjolly, J.\u00a0M., & Mohan,\u00a0S. (2001). A\u00a0tabu-search heuristic for the capacitated lot sizing problem with set-up carryover. Management Science, 47, 851\u2013863.","journal-title":"Management Science"},{"key":"147_CR18","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1080\/09537280050051997","volume":"11","author":"T. Hayrinen","year":"2000","unstructured":"Hayrinen,\u00a0T., Johnsson,\u00a0M., Jahletta,\u00a0T., Smed,\u00a0J., & Nevalainen,\u00a0O. (2000). Scheduling algorithms for computer-aided line balancing in printed circuit board assembly. Production Planning and Control, 11, 497\u2013510.","journal-title":"Production Planning and Control"},{"issue":"3","key":"147_CR19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1287\/opre.42.2.201","volume":"42","author":"J.\u00a0N. Hooker","year":"1994","unstructured":"Hooker, J.\u00a0N. (1994). Needed: An empirical science of algorithms. Operations Research, 42(3), 201\u2013212.","journal-title":"Operations Research"},{"key":"147_CR20","first-page":"1871","volume":"28","author":"M. Johnson","year":"2001","unstructured":"Johnson,\u00a0M., & Smed,\u00a0J. (2001). Observations on PCB assembly optimization. Electronic Packaging and Production, 28, 1871\u20131883.","journal-title":"Electronic Packaging and Production"},{"key":"147_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.48.1.99.12447","volume":"48","author":"J.\u00a0J. Kanet","year":"2000","unstructured":"Kanet, J.\u00a0J., & Sridharan,\u00a0V. (2000). Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research, 48, 99\u2013110.","journal-title":"Operations Research"},{"key":"147_CR22","first-page":"389","volume":"8","author":"V.\u00a0J. Leon","year":"1996","unstructured":"Leon, V.\u00a0J., & Peters, B.\u00a0A. (1996). Replanning and analysis of partial setup strategies in printed circuit board assembly systems. International Journal of Flexible Manufacturing Systems, 8, 389\u2013412.","journal-title":"International Journal of Flexible Manufacturing Systems"},{"key":"147_CR23","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1057\/palgrave.jors.2600373","volume":"48","author":"R. Logendran","year":"1997","unstructured":"Logendran,\u00a0R., & Sonthinen,\u00a0A. (1997). A\u00a0tabu search-based approach for scheduling job-shop type flexible manufacturing systems. Journal of the Operational Research Society, 48, 264\u2013277.","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"147_CR24","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1080\/07408170490279598","volume":"6","author":"R. Logendran","year":"2004","unstructured":"Logendran,\u00a0R., & Subur,\u00a0F. (2004). Unrelated parallel machine scheduling with job splitting. IIE Transactions, 6(4), 359\u2013372.","journal-title":"IIE Transactions"},{"key":"147_CR25","doi-asserted-by":"crossref","first-page":"1370","DOI":"10.1080\/00207549108948017","volume":"29","author":"O. Maimon","year":"1991","unstructured":"Maimon,\u00a0O., & Schtub,\u00a0A. (1991). Grouping methods for printed circuit boards. International Journal of Production Research, 29, 1370\u20131390.","journal-title":"International Journal of Production Research"},{"key":"147_CR26","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1080\/07408179208964231","volume":"24","author":"L.\u00a0F. McGinnis","year":"1992","unstructured":"McGinnis, L.\u00a0F., Ammons, J.\u00a0C., Carlyle,\u00a0M., Cranmer,\u00a0L., Depuy, G.\u00a0W., Ellis, K.\u00a0P. Tovey, C.\u00a0A. & Xu,\u00a0H. (1992). Automated process planning for printed circuit card assembly. IIE Transactions, 24, 18\u201330.","journal-title":"IIE Transactions"},{"key":"147_CR27","volume-title":"Design and analysis of experiments","author":"D.\u00a0C. Montgomery","year":"2005","unstructured":"Montgomery, D.\u00a0C. (2005). Design and analysis of experiments. New York: Wiley."},{"issue":"1","key":"147_CR28","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0360-8352(03)00043-3","volume":"45","author":"M.\u00a0D. Rossetti","year":"2003","unstructured":"Rossetti, M.\u00a0D., & Stanford, K.\u00a0J.\u00a0A. (2003). Group sequencing a PCB assembly system via an expected sequence dependent setup heuristic. Computers and Industrial Engineering, 45(1), 231\u2013254.","journal-title":"Computers and Industrial Engineering"},{"key":"147_CR29","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M. Savelsbergh","year":"1997","unstructured":"Savelsbergh,\u00a0M. (1997). A\u00a0branch-and-price algorithm for the generalized assignment problem. Operations Research, 45, 831\u2013841.","journal-title":"Operations Research"},{"key":"147_CR30","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0360-8352(01)00049-3","volume":"41","author":"J.\u00a0E. Schaller","year":"2001","unstructured":"Schaller, J.\u00a0E. (2001). A\u00a0new lower bound for the flow shop group scheduling problem. Computers and Industrial Engineering, 41, 151\u2013161.","journal-title":"Computers and Industrial Engineering"},{"key":"147_CR31","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/A:1023900922864","volume":"15","author":"J. Smed","year":"2004","unstructured":"Smed,\u00a0J., Salonen,\u00a0K., Johnsson,\u00a0M., Johletta,\u00a0T., & Nevalainen,\u00a0O. (2004). Grouping PBCs with minimum feeder changes. International Journal of Flexible Manufacturing Systems, 15, 19\u201335.","journal-title":"International Journal of Flexible Manufacturing Systems"},{"key":"147_CR32","first-page":"173","volume":"31","author":"C.\u00a0R. Sox","year":"1999","unstructured":"Sox, C.\u00a0R., & Gao,\u00a0Y. (1999). The capacitated lot sizing problem with setup carry-over. IIE Transactions, 31, 173\u2013181.","journal-title":"IIE Transactions"},{"key":"147_CR33","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0167-6377(00)00021-3","volume":"26","author":"V.\u00a0A. Strusevic","year":"2000","unstructured":"Strusevic, V.\u00a0A. (2000). Group technology approach to the open shop scheduling problem with batch setup times. Operations Research Letters, 26, 181\u2013192.","journal-title":"Operations Research Letters"},{"key":"147_CR34","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/mnsc.49.8.1039.16406","volume":"49","author":"C. Suerie","year":"2003","unstructured":"Suerie,\u00a0C., & Stadtler,\u00a0H. (2003). The capacitated lot-sizing problem with linked lot sizes. Management Science, 49, 1039\u20131054.","journal-title":"Management Science"},{"key":"147_CR35","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/opre.36.5.767","volume":"36","author":"C.\u00a0S. Tang","year":"1988","unstructured":"Tang, C.\u00a0S., & Denardo, E.\u00a0V. (1988). Models arising from a flexible manufacturing machine, part 1: Minimization of the number of tool switches. Operations Research, 36, 767\u2013777.","journal-title":"Operations Research"},{"key":"147_CR36","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"J. Akker Van\u00a0den","year":"1999","unstructured":"Van\u00a0den Akker,\u00a0J., Hoogeven,\u00a0J., & Van\u00a0de Velde,\u00a0S. (1999). Parallel machine scheduling by column generation. Operations Research, 47, 862\u2013872.","journal-title":"Operations Research"},{"key":"147_CR37","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0167-6377(96)00033-8","volume":"19","author":"F. Vanderbeck","year":"1996","unstructured":"Vanderbeck,\u00a0F., & Wolsey,\u00a0L. (1996). An exact algorithm for IP column generation. Operations Research Letters, 19, 151\u2013159.","journal-title":"Operations Research Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0147-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0147-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0147-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:43Z","timestamp":1559468383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0147-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,17]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["147"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0147-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,17]]}}}