{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:12:22Z","timestamp":1771877542248,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,5]],"date-time":"2007-12-05T00:00:00Z","timestamp":1196812800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s10479-007-0273-2","type":"journal-article","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T16:12:40Z","timestamp":1196957560000},"page":"5-24","source":"Crossref","is-referenced-by-count":7,"title":["Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem"],"prefix":"10.1007","volume":"159","author":[{"given":"Fehmi","family":"Tanrisever","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erhan","family":"Kutanoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,5]]},"reference":[{"key":"273_CR1","volume-title":"Network flows: Theory, algorithms, and applications","author":"R. K. Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs: Prentice Hall."},{"key":"273_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","volume":"47","author":"S. Albers","year":"1993","unstructured":"Albers, S., & Brucker, P. (1993). The complexity of one-machine batching problems. Discrete Applied Mathematics, 47, 87\u2013107.","journal-title":"Discrete Applied Mathematics"},{"key":"273_CR3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0360-8352(01)00009-2","volume":"39","author":"M. Azizoglu","year":"2001","unstructured":"Azizoglu, M., & Webster, S. (2001). Scheduling a batch processing machine with incompatible job families. Computers and Industrial Engineering, 39, 325\u2013335.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"273_CR4","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1080\/002075497195623","volume":"35","author":"P. Chandra","year":"1997","unstructured":"Chandra, P., & Gupta, S. (1997). Managing batch processors to reduce lead time in a semiconductor packaging line. International Journal of Production Research, 35(3), 611\u2013633.","journal-title":"International Journal of Production Research"},{"issue":"9","key":"273_CR5","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1080\/00207549308956847","volume":"31","author":"V. Chandru","year":"1993","unstructured":"Chandru, V., Lee, C. Y., & Uzsoy, R. (1993a). Minimizing total completion time on batch processing machines. International Journal of Production Research, 31(9), 2097\u20132121.","journal-title":"International Journal of Production Research"},{"key":"273_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","volume":"13","author":"V. Chandru","year":"1993","unstructured":"Chandru, V., Lee, C. Y., & Uzsoy, R. (1993b). Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13, 61\u201365.","journal-title":"Operations Research Letters"},{"key":"273_CR7","first-page":"413","volume":"33","author":"T. C. E. Cheng","year":"2001","unstructured":"Cheng, T. C. E., & Kovalyov, M. Y. (2001). Single machine batch scheduling with sequential job processing. IIE Transactions, 33, 413\u2013420.","journal-title":"IIE Transactions"},{"issue":"3","key":"273_CR8","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/opre.37.3.426","volume":"37","author":"E. G. Coffman","year":"1989","unstructured":"Coffman, E. G., Nozari, A., & Yannakakis, M. (1989). Optimal scheduling of products with two subassemblies on a single machine. Operations Research, 37(3), 426\u2013436.","journal-title":"Operations Research"},{"key":"273_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","volume":"26","author":"E. G. Coffman","year":"1990","unstructured":"Coffman, E. G., Yannakakis, M., Magazine, M. J., & Santos, C. A. (1990). Batch sizing and job sequencing on a single machine. Annals of Operations Research, 26, 135\u2013147.","journal-title":"Annals of Operations Research"},{"key":"273_CR10","unstructured":"Dash Optimization. (2006). XPRESS-optimizer reference manual\u2014Release 17."},{"issue":"1","key":"273_CR11","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.49.1.52.11189","volume":"49","author":"G. Dobson","year":"2001","unstructured":"Dobson, G., & Nambimadom, R. S. (2001). The batch loading and scheduling problem. Operations Research, 49(1), 52\u201365.","journal-title":"Operations Research"},{"issue":"8","key":"273_CR12","doi-asserted-by":"crossref","first-page":"1841","DOI":"10.1080\/002075400188627","volume":"38","author":"J. W. Fowler","year":"2000","unstructured":"Fowler, J. W., Knutson, K., & Carlyle, W. M. (2000). Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility. International Journal of Production and Research, 38(8), 1841\u20131853.","journal-title":"International Journal of Production and Research"},{"key":"273_CR13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0925-5273(98)00067-X","volume":"55","author":"F. J. Ghazvini","year":"1998","unstructured":"Ghazvini, F. J., & DuPont, L. (1998). Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. International Journal of Production Economics, 55, 273\u2013280.","journal-title":"International Journal of Production Economics"},{"key":"273_CR14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(94)90063-9","volume":"16","author":"D. S. Hochbaum","year":"1994","unstructured":"Hochbaum, D. S., & Landy, D. (1994). Scheduling with batching: Minimizing the weighted number of tardy jobs. Operations Research Letters, 16, 79\u201386.","journal-title":"Operations Research Letters"},{"key":"273_CR15","unstructured":"ILOG. I. (2005). ILOG CPLEX 10.0 reference manual."},{"issue":"11","key":"273_CR16","first-page":"1103","volume":"31","author":"K. Knutson","year":"1999","unstructured":"Knutson, K., Kempf, K., Fowler, J. W., & Carlyle, M. (1999). Lot-to-order matching for a semiconductor assembly and test facility. IIE Transactions, 31(11), 1103\u20131111.","journal-title":"IIE Transactions"},{"key":"273_CR17","volume-title":"Combinatorial optimization: Theory and algorithms","author":"B. Korte","year":"2006","unstructured":"Korte, B., & Vygen, J. (2006). Combinatorial optimization: Theory and algorithms. Berlin: Springer."},{"key":"273_CR18","unstructured":"Mason, S. J., Kutanoglu, E., Fowler, J. W., & Qu, P. (2004, submitted). The single machine multiple orders per job scheduling problem. IIE Transactions. Second revision."},{"key":"273_CR19","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C. N. Potts","year":"2000","unstructured":"Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operations Research, 120, 228\u2013249.","journal-title":"European Journal of Operations Research"},{"issue":"7","key":"273_CR20","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R. Uzsoy","year":"1994","unstructured":"Uzsoy, R. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32(7), 1615\u20131635.","journal-title":"International Journal of Production Research"},{"issue":"10","key":"273_CR21","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1080\/00207549508904839","volume":"33","author":"R. Uzsoy","year":"1995","unstructured":"Uzsoy, R. (1995). Scheduling batch processing machines with incompatible job families. International Journal of Production Research, 33(10), 2685\u20132708.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"273_CR22","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0377-2217(03)00361-8","volume":"158","author":"J. J. Yuan","year":"2003","unstructured":"Yuan, J. J., Yang, A. F., & Cheng, T. C. E. (2003). A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times. European Journal of Operations Research, 158(2), 525\u2013528.","journal-title":"European Journal of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0273-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-007-0273-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0273-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:44Z","timestamp":1559153264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-007-0273-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,5]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["273"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0273-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,5]]}}}