{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T09:58:53Z","timestamp":1760522333818},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/s10878-005-5488-z","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T22:08:53Z","timestamp":1108591733000},"page":"121-138","source":"Crossref","is-referenced-by-count":7,"title":["Order Consolidation for Batch Processing"],"prefix":"10.1007","volume":"9","author":[{"given":"Hark-Chin","family":"Hwang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soo Y.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy ?Proof verification and hardness of approximation problems,?in Proceedings of the 33rd IEEE Symposium on the Foundations of Computer Science, 1992, pp 14?23.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1080\/095372800232090","volume":"11","author":"S.Y. Chang","year":"2000","unstructured":"S.Y. Chang, M.R. Chang, and Y.S. Hong ?A lot grouping algorithm for a continuous slab caster in an integrated steel mill,?Production Planning & Control, vol. 11, pp. 363?368, 2000.","journal-title":"Production Planning & Control"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0377-2217(94)90122-8","volume":"78","author":"Y. Crama","year":"1994","unstructured":"Y. Crama and A.G. Oerlemans ?A column generation approach to job grouping for flexible manufacturing systems,?European Journal of Operational Research, vol. 78, pp. 58?80, 1994.","journal-title":"European Journal of Operational Research"},{"key":"CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: San Francisco, CA, 1979."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"38","author":"V. Kann","year":"1991","unstructured":"V. Kann?Maximum bounded 3-dimensional matching is MAX SNP-complete,?Information Processing Letters, vol. 38, pp. 27?35, 1991.","journal-title":"Information Processing Letters"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/S0377-2217(01)00204-1","volume":"140","author":"T. Knuutila","year":"2002","unstructured":"T. Knuutila and O. Nevalainen ?A reduction technique for weighted grouping problems,?EuropeanJournal of Operational Research, vol. 140, pp. 590?605, 2002.","journal-title":"European Journal of Operational Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C.-Y. Lee","year":"1992","unstructured":"C.-Y. Lee, R. Uzsoy, and L.A. Martin-Vega ?Efficient algorithms for scheduling semiconductor burn-in operations,?Operations Research, vol. 40, pp. 764?775, 1992.","journal-title":"Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"S. Micali and V.V. Vazirani ?An $$O(\\sqrt{|V|}\\cdot|E|)$$ algorithm for finding maximum matching in general graphs,?in Proc. Twenty-first Annual Symposium on the Foundations of Computer Science, 1980, pp. 17?27.","DOI":"10.1109\/SFCS.1980.12"},{"key":"CR9","volume-title":"Combinatorial Optimization","author":"C.H. Papadimitriou","year":"1988","unstructured":"C.H. Papadimitriou and K. Steiglitz Combinatorial Optimization, Dover Publications: Mineola, NY, 1988."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"C.H. Papadimitriou and M. Yannakakis?Optimization,approximation and complexity classes,?Journal of Computer and System Sciences, vol. 43, pp. 425?440, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C.N. Potts","year":"2000","unstructured":"C.N. Potts and M.Y. Kovalyov ?Scheduling with batching: A review,?European Journal of Operational Research, vol. 120, pp. 228?249, 2000.","journal-title":"European Journal of Operational Research"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(00)00240-X","volume":"133","author":"L. Tang","year":"2001","unstructured":"L. Tang, J. Liu, A. Ring, and Z. Yang ?A review of planning and scheduling systems and methods for integrated steel production,?European Journal of Operational Research, vol. 133, pp. 1?20, 2001.","journal-title":"European Journal of Operational Research"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1080\/00207549508904839","volume":"33","author":"R. Uzsoy","year":"1995","unstructured":"R. Uzsoy ?Scheduling batch processing machines with incompatible job families,?Int. J. Prod. Res., vol. 33, pp. 2685?2708, 1995.","journal-title":"Int. J. Prod. Res."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5488-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-5488-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5488-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:06:14Z","timestamp":1586117174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-5488-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["5488"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-5488-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}