{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T01:07:44Z","timestamp":1648602464202},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s11424-010-0210-3","type":"journal-article","created":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T03:40:20Z","timestamp":1289187620000},"page":"884-895","source":"Crossref","is-referenced-by-count":2,"title":["MIP formulations and heuristics for solving parallel batching problems"],"prefix":"10.1007","volume":"23","author":[{"given":"Udo","family":"Buscher","sequence":"first","affiliation":[]},{"given":"Liji","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,9]]},"reference":[{"key":"210_CR1","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, 2000, 120: 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"210_CR2","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1016\/j.ijpe.2006.02.010","volume":"103","author":"P. Damodaran","year":"2006","unstructured":"P. Damodaran, P. K. Manjeshwar, and K. Srihari, Minimizing makespan on a batch processing machine with non-identical job sizes using genetic algorithms, International Journal of Production Economics, 2006, 103: 882\u2013891.","journal-title":"International Journal of Production Economics"},{"key":"210_CR3","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1080\/00207549308956847","volume":"31","author":"V. Chandru","year":"1993","unstructured":"V. Chandru, C. Y. Lee, and R. Uzsoy, Minimizing total completion time on batch processing machines, International Journal of Production Research, 1993, 31: 2097\u20132121.","journal-title":"International Journal of Production Research"},{"key":"210_CR4","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/0377-2217(95)00332-0","volume":"96","author":"C. L. Li","year":"1997","unstructured":"C. L. Li and C. Y. Lee, Scheduling with agreeable release times and due dates on a batch processing machine, European Journal of Operational Research, 1997, 96: 564\u2013569.","journal-title":"European Journal of Operational Research"},{"key":"210_CR5","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(98)00391-9","volume":"120","author":"C. S. Sung","year":"2000","unstructured":"C. S. Sung and Y. I. Choung, Minimizing makespan on a single burn-in oven in semiconductor manufacturing, European Journal of Operational Research, 2000, 120: 559\u2013574.","journal-title":"European Journal of Operational Research"},{"key":"210_CR6","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R. Uzsoy","year":"1994","unstructured":"R. Uzsoy, Scheduling a single batch processing machine with non-identical job sizes, International Journal of Production Research, 1994, 32: 1615\u20131635.","journal-title":"International Journal of Production Research"},{"key":"210_CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y. Ikura","year":"1986","unstructured":"Y. Ikura and M. Gimple, Scheduling algorithms for a single batch processing machine, Operations Research Letters, 1986, 5: 61\u201365.","journal-title":"Operations Research Letters"},{"key":"210_CR8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1018912114491","volume":"83","author":"P. Brucker","year":"1998","unstructured":"P. Brucker, M. Y. Kovalyov, Y. M. Shafransky, and F. Werner, Batch scheduling with deadlines on parallel machines, Annals of Operations Research, 1998, 83: 23\u201340.","journal-title":"Annals of Operations Research"},{"key":"210_CR9","first-page":"165","volume":"30","author":"S. V. Mehta","year":"1998","unstructured":"S. V. Mehta and R. Uzsoy, Minimizing total tardiness on a batch processing machine with incompatible job families, IIE Transactions, 1998, 30: 165\u2013178.","journal-title":"IIE Transactions"},{"key":"210_CR10","doi-asserted-by":"crossref","unstructured":"A. Devpura, J. W. Fowler, M. Carlyle, and I. Perez, Minimizing total weighted tardiness on a single batch processing machine with incompatible job families, in Proceedings of the Symposium on Operations Research, 2000: 366\u2013371.","DOI":"10.1007\/978-3-642-56656-1_58"},{"key":"210_CR11","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/S0305-0548(00)00078-2","volume":"29","author":"L. Dupont","year":"2002","unstructured":"L. Dupont and C. Dhaenens-Flipo, Minimizing the makespan on a batch processing machine with non-identical job sizes, Computers and Operations Research, 2002, 29: 807\u2013819.","journal-title":"Computers and Operations Research"},{"key":"210_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0925-5273(03)00092-6","volume":"87","author":"S. Melouk","year":"2004","unstructured":"S. Melouk, P. Damodaran, and P. Y. Chang, Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing, International Journal of Production Economics, 2004, 87: 141\u2013147.","journal-title":"International Journal of Production Economics"},{"key":"210_CR13","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1002\/(SICI)1520-6750(200003)47:2<128::AID-NAV4>3.0.CO;2-#","volume":"47","author":"T. C. E. Cheng","year":"2000","unstructured":"T. C. E. Cheng, B. M. T. Lin, and A. Toker, Makespan minimization in the two-machine flowshop batch scheduling problem, Naval Research Logistics, 2000, 47: 128\u2013144.","journal-title":"Naval Research Logistics"},{"key":"210_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0377-2217(99)00031-4","volume":"121","author":"C. S. Sung","year":"2000","unstructured":"C. S. Sung, Y. H. Kim, and S. H. Yoon, A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines, European Journal of Operational Research, 2000, 121: 179\u2013192.","journal-title":"European Journal of Operational Research"},{"key":"210_CR15","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.40.4.750","volume":"39","author":"J. H. Ahmadi","year":"1992","unstructured":"J. H. Ahmadi, R. H. Ahmadi, S. Dasu, and C. S. Tang, Batching and scheduling jobs on batch and discrete processors, Operations Research, 1992, 39: 750\u2013763.","journal-title":"Operations Research"},{"key":"210_CR16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/1099-1425(200101\/02)4:1<25::AID-JOS58>3.0.CO;2-7","volume":"4","author":"C. N. Potts","year":"2001","unstructured":"C. N. Potts, V. A. Strusevich, and T. Tautenhahn, Scheduling batches with simultaneous job processing for two-machine shop problems, Journal of Scheduling, 2001, 4: 25\u201351.","journal-title":"Journal of Scheduling"},{"key":"210_CR17","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1016\/j.mcm.2005.01.005","volume":"40","author":"P. Damodaran","year":"2004","unstructured":"P. Damodaran and K. Srihari, Mixed integer formulation to minimize makespan in a flow shop with batch processing machines, Mathematical and Computer Modelling, 2004, 40: 1465\u20131472.","journal-title":"Mathematical and Computer Modelling"},{"key":"210_CR18","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1016\/j.mcm.2008.01.001","volume":"48","author":"C. Liao","year":"2008","unstructured":"C. Liao and L. Liao, Improved milp models for two-machine flowshop with batch processing machines, Mathematical and Computer Modelling, 2008, 48: 1254\u20131264.","journal-title":"Mathematical and Computer Modelling"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-010-0210-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-010-0210-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-010-0210-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T23:51:02Z","timestamp":1559778662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-010-0210-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["210"],"URL":"https:\/\/doi.org\/10.1007\/s11424-010-0210-3","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10]]}}}