{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:46:54Z","timestamp":1743065214622,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359651"},{"type":"electronic","value":"9783642359668"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35966-8_9","type":"book-chapter","created":{"date-parts":[[2013,3,28]],"date-time":"2013-03-28T08:35:38Z","timestamp":1364459738000},"page":"113-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Multiple Batch Processing Machine Problem with Stage Specific Incompatible Job Families"],"prefix":"10.1007","author":[{"given":"Marc-Andr\u00e8","family":"Isenberg","sequence":"first","affiliation":[]},{"given":"Bernd","family":"Scholz-Reiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985\u20131032","journal-title":"Eur J Oper Res"},{"unstructured":"Bixby R, Gu Z, Rothberg E (2012) Gurobi. URL http:\/\/www.gurobi.com. Accessed 12\/03\/16","key":"9_CR2"},{"unstructured":"Buscher U, Shen L (2009) MIP-based approaches for solving scheduling problems with batch processing machines. Oper Res 132\u2013139","key":"9_CR3"},{"issue":"12","key":"9_CR4","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1016\/j.cor.2010.03.017","volume":"37","author":"T Chiang","year":"2010","unstructured":"Chiang T, Cheng H (2010) A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival. Comput Oper Res 37(12):2257\u20132269","journal-title":"Comput Oper Res"},{"unstructured":"Fu Q, Sivakumar A, Li K (2011) Optimisation of flow-shop scheduling with batch processor and limited buffer. Int J Prod Res p Forthcoming article the multiple batch processing machine problem 11","key":"9_CR5"},{"key":"9_CR6","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR, Johnson DS (1990) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co., New York"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.13.2.120.10521","volume":"13","author":"CA Glass","year":"2001","unstructured":"Glass CA, Potts CN, Strusevich VA (2001) Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS J Comput 13(2):120\u2013137","journal-title":"INFORMS J Comput"},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan Rinnooy A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"4-Part-1","key":"9_CR10","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1287\/opre.1090.0788","volume":"58","author":"P Jula","year":"2010","unstructured":"Jula P, Leachman R (2010) Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints. Oper Res 58(4-Part-1):933\u2013947","journal-title":"Oper Res"},{"issue":"5","key":"9_CR11","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1109\/70.964660","volume":"17","author":"Yd Kim","year":"2001","unstructured":"Kim Yd, Kim Jg, Choi B, Kim Hu (2001) Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates. IEEE Trans Robot 17(5):589\u2013598","journal-title":"IEEE Trans Robot"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ijpe.2004.10.001","volume":"98","author":"S Koh","year":"2005","unstructured":"Koh S, Koo P, Kim D, Hur W (2005) Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. Int J Prod Econ 98(1):81\u201396","journal-title":"Int J Prod Econ"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.rcim.2008.05.003","volume":"25","author":"P Kumar Manjeshwar","year":"2009","unstructured":"Kumar Manjeshwar P, Damodaran P, Srihari K (2009) Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing. Robot Comput Integrated Manuf 25(3):667\u2013679","journal-title":"Robot Comput Integrated Manuf"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1080\/00207540903536130","volume":"49","author":"D Lei","year":"2011","unstructured":"Lei D, Guo XP (2011) Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines. Int J Prod Res 49(2):519\u2013529","journal-title":"Int J Prod Res"},{"issue":"9\u201310","key":"9_CR15","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","volume":"29","author":"M Mathirajan","year":"2006","unstructured":"Mathirajan M, Sivakumar A (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int J Adv Manuf Tech 29(9\u201310):990\u20131001","journal-title":"Int J Adv Manuf Tech"},{"issue":"6","key":"9_CR16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10951-007-0041-9","volume":"10","author":"CT Ng","year":"2007","unstructured":"Ng CT, Kovalyov MY (2007) Batching and scheduling in a multi-machine flow shop. J Sched 10(6):353\u2013364","journal-title":"J Sched"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C Potts","year":"2000","unstructured":"Potts C, Kovalyov M (2000) Scheduling with batching: a review. Eur J Oper Res 120(2):228\u2013249","journal-title":"Eur J Oper Res"},{"unstructured":"Tajan JBC, Sivakumar AI, Gershwin SB (2006) Performance of a serial-batch processor system with incompatible job families under simple control policies. Mechanical Engineering (65), URL http:\/\/hdl.handle.net\/1721.1\/29835","key":"9_CR18"},{"issue":"7","key":"9_CR19","doi-asserted-by":"publisher","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 nonidentical job sizes. Int J Prod Res 32(7):1615\u20131635","journal-title":"Int J Prod Res"},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S Webster","year":"1995","unstructured":"Webster S, Baker KR (1995) Scheduling groups of jobs on a single machine. Oper Res 43(4):692\u2013703","journal-title":"Oper Res"},{"issue":"5","key":"9_CR21","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1016\/j.cor.2011.06.003","volume":"39","author":"S Yao","year":"2012","unstructured":"Yao S, Jiang Z, Li N (2012) A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals. Comput Oper Res 39(5):939\u2013951","journal-title":"Comput Oper Res"},{"issue":"6","key":"9_CR22","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s10951-006-8776-2","volume":"9","author":"JJ Yuan","year":"2006","unstructured":"Yuan JJ, Liu ZH, Ng CT, Cheng TCE (2006) Single machine batch scheduling problem with family setup times and release dates to minimize makespan. J Sched 9(6):499\u2013551","journal-title":"J Sched"}],"container-title":["Lecture Notes in Logistics","Dynamics in Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35966-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T16:44:07Z","timestamp":1676306647000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-35966-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642359651","9783642359668"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35966-8_9","relation":{},"ISSN":["2194-8917","2194-8925"],"issn-type":[{"type":"print","value":"2194-8917"},{"type":"electronic","value":"2194-8925"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"29 March 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}