{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:40:49Z","timestamp":1742928049798,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"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_10","type":"book-chapter","created":{"date-parts":[[2013,3,28]],"date-time":"2013-03-28T08:35:38Z","timestamp":1364459738000},"page":"125-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Multiple Batch Processing Machines 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":[{"issue":"2","key":"10_CR1","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 job-shop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan Rinnooy A (1979) Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. Ann Discrete Math, vol 5. Elsevier, pp 287\u2013326","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"1","key":"10_CR3","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":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto M, Nishimura T (1998) Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comput Simulat 8(1):3\u201330","journal-title":"ACM Trans Model Comput Simulat"},{"issue":"2","key":"10_CR5","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"},{"key":"10_CR6","unstructured":"Xu R, Wunsch DC (2009) Clustering. IEEE series on computational intelligence, Wiley"},{"issue":"5","key":"10_CR7","doi-asserted-by":"crossref","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) Abranch 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"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T11:31:56Z","timestamp":1676806316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-35966-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642359651","9783642359668"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35966-8_10","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"}}]}}