{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T00:38:31Z","timestamp":1770079111595,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,11]],"date-time":"2007-12-11T00:00:00Z","timestamp":1197331200000},"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-0276-z","type":"journal-article","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T16:05:35Z","timestamp":1197302735000},"page":"161-181","source":"Crossref","is-referenced-by-count":40,"title":["Cyclic job shop scheduling problems with blocking"],"prefix":"10.1007","volume":"159","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Kampmeyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,12,11]]},"reference":[{"key":"276_CR1","unstructured":"Beasley, J. E. (2005). Benchmark problems. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html ."},{"key":"276_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling algorithms (4th edn.) Berlin: Springer.","edition":"4"},{"key":"276_CR3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10951-005-1639-4","volume":"8","author":"P. Brucker","year":"2005","unstructured":"Brucker, P., & Kampmeyer, T. (2005). Tabu search algorithms for cyclic machine scheduling problems. Journal of Scheduling, 8, 303\u2013322.","journal-title":"Journal of Scheduling"},{"key":"276_CR4","doi-asserted-by":"crossref","unstructured":"Brucker, P., & Kampmeyer, T. (2007, to appear). A general model for cyclic machine scheduling problems. Discrete Applied Mathematics.","DOI":"10.1016\/j.dam.2008.03.029"},{"key":"276_CR5","volume-title":"Les Probl\u00e8mes d\u2019ordonnancement","author":"J. Carlier","year":"1988","unstructured":"Carlier, J., & Chr\u00e9tienne, P. (1988). Les Probl\u00e8mes d\u2019ordonnancement. Paris: Masson."},{"key":"276_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/309847.309862","volume-title":"Proceedings of the 36th ACM\/IEEE conference on design automation conference","author":"A. Dasdan","year":"1999","unstructured":"Dasdan, A., Irani, S. S., & Gupta, R. K. (1999). Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In Proceedings of the 36th ACM\/IEEE conference on design automation conference (pp. 37\u201342). Annual ACM IEEE design automation conference, NY, USA. New York: ACM."},{"key":"276_CR7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search. I. ORSA Journal on Computing, 1, 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"276_CR8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). Tabu search. II. ORSA Journal on Computing, 2, 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"276_CR9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0377-2217(94)90332-8","volume":"72","author":"C. Hanen","year":"1994","unstructured":"Hanen, C. (1994). Study of a NP-hard cyclic scheduling problem: the recurrent job-shop. European Journal of Operations Research, 72, 82\u2013101.","journal-title":"European Journal of Operations Research"},{"key":"276_CR10","unstructured":"Kampmeyer, T. (2006). Cyclic scheduling problems. Ph.D. thesis, University of Osnabr\u00fcck."},{"key":"276_CR11","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A. Mascis","year":"2002","unstructured":"Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operations Research, 143, 498\u2013517.","journal-title":"European Journal of Operations Research"},{"issue":"6","key":"276_CR12","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"S. T. McCormick","year":"1989","unstructured":"McCormick, S. T., Pinedo, M., Shenker, S., et al. (1989). Sequencing in an assembly line with blocking to minimize cycle time. Operations Research, 37(6), 925\u2013935.","journal-title":"Operations Research"},{"key":"276_CR13","unstructured":"Nieberg, T. (2002). Tabusuche f\u00fcr Flow-Shop und Job-Shop Probleme mit begrenztem Zwischenspeicher. Master\u2019s thesis, University of Osnabr\u00fcck."},{"issue":"2","key":"276_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0360-8352(97)00325-2","volume":"34","author":"J. S. Song","year":"1998","unstructured":"Song, J. S., & Lee, T. E. (1998). Petri net modeling and scheduling for cyclic job shops with problems. Computers Industrial Engineering, 34(2), 281\u2013295.","journal-title":"Computers Industrial Engineering"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0276-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-007-0276-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0276-z","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-0276-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,11]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["276"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0276-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,11]]}}}