{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:00:01Z","timestamp":1774368001175,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10951-005-1639-4","type":"journal-article","created":{"date-parts":[[2005,5,23]],"date-time":"2005-05-23T17:45:58Z","timestamp":1116870358000},"page":"303-322","source":"Crossref","is-referenced-by-count":27,"title":["Tabu Search Algorithms for Cyclic Machine Scheduling Problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Kampmeyer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"1639_CR1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/212094.212131","volume":"27","author":"V. Allan","year":"1995","unstructured":"Allan, V., R. Jones, R. Lee, and S. Allan, \u201cSoftware pipelining,\u201d ACM Computing Surveys, 27(3), 367\u2013432 (1995).","journal-title":"ACM Computing Surveys"},{"key":"1639_CR2","unstructured":"Beasley, J. E. \u201cBenchmark problems,\u201d http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html."},{"key":"1639_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P. Scheduling Algorithms. Springer-Verlag, Berlin, fourth edition, 2004.","edition":"fourth edition"},{"key":"1639_CR4","unstructured":"Carlier, J. and P. Chretienne, \u201cLes Probl\u00e9mes d\u2019Ordonnancement,\u201d Technical report, Masson, Paris, 1988."},{"issue":"2","key":"1639_CR5","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TAC.1985.1103925","volume":"30","author":"G. Cohen","year":"1985","unstructured":"Cohen, G., D. Dubois, J. P. Quadrat, and M. Viot, \u201cA linear system theretic view of discrete event process and its use for performance evaluation in manufacturing,\u201d IEEE Transactions on Automatic Control, 30(2), 210\u2013220 (1985).","journal-title":"IEEE Transactions on Automatic Control"},{"key":"1639_CR6","doi-asserted-by":"crossref","unstructured":"Dasdan, A., S. S. Irani, and R. K. Gupta. \u201cEfficient algorithms for optimum cycle mean and optimum cost to time ratio problems,\u201d in Proceedings of the 36th ACM\/IEEE Conference on Design Automation Conference, Annual ACM IEEE Design Automation Conference, ACM Press New York, NY, USA, 1999, pp. 37\u201342.","DOI":"10.1145\/309847.309862"},{"key":"1639_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. \u201cTabu search I,\u201d ORSA Journal on Computing, 1, 190\u2013206 (1989).","journal-title":"ORSA Journal on Computing"},{"key":"1639_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. \u201cTabu search II,\u201d ORSA Journal on Computing, 2, 4\u201332 (1990).","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"1639_CR9","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/jos.100","volume":"5","author":"N. G. Hall","year":"2002","unstructured":"Hall, N. G., T. E. Lee, and M. E. Posner, \u201cThe complexity of cyclic shop scheduling problems,\u201d Journal of Scheduling, 5(4), 307\u2013327 (2002).","journal-title":"Journal of Scheduling"},{"key":"1639_CR10","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. \u201cStudy of a NP-hard cyclic scheduling problem: The recurrent job-shop,\u201d European Journal of Operational Research, 72, 82\u2013101 (1994).","journal-title":"European Journal of Operational Research"},{"key":"1639_CR11","volume-title":"Scheduling Theory and Its Applications","author":"C. Hanen","year":"1995","unstructured":"Hanen, C. and A. Munier, \u201cCyclic scheduling on parallel processors: on overview,\u201d chapter 4. In P. Chretienne, E. G. Coffman, J. K. Lentra, and Z. Liu (eds.), Scheduling Theory and Its Applications, Wiley, New York, 1995."},{"issue":"2\u20133","key":"1639_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0166-218X(94)00102-J","volume":"57","author":"C. Hanen","year":"1995","unstructured":"Hanen, C. and A. Munier, \u201cA study of the cyclic scheduling problem on parallel processors,\u201d Discrete Applied Mathematics, 57(2\u20133), 167\u2013192 (1995).","journal-title":"Discrete Applied Mathematics"},{"key":"1639_CR13","doi-asserted-by":"crossref","unstructured":"Korst, J., \u201cPeriodic multiprocessor scheduling,\u201d PhD thesis, TU Eindhoven, 1992.","DOI":"10.1007\/978-3-662-25209-3_12"},{"key":"1639_CR14","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1287\/opre.45.1.72","volume":"45","author":"T. Lee","year":"1997","unstructured":"Lee, T. and M. Posner, \u201cPerformance measures and schedules in periodic job shop,\u201d Operations Research, 45, 72\u201391 (1997).","journal-title":"Operations Research"},{"key":"1639_CR15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01205181","volume":"7","author":"B. R. Rau","year":"1993","unstructured":"Rau, B. R. and J. A. Fisher, \u201cInstruction-level parallel processing: History, overview and perspective,\u201d Journal of Supercomputing, 7, 9\u201350 (1993).","journal-title":"Journal of Supercomputing"},{"key":"1639_CR16","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/moor.17.4.842","volume":"17","author":"R. Roundy","year":"1992","unstructured":"Roundy, R., \u201cCyclic schedules for job-shops with identical jobs,\u201d Mathematics of Operations Research, 17, 842\u2013865 (1992).","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"1639_CR17","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0402049","volume":"2","author":"P. Serafini","year":"1986","unstructured":"Serafini, P. and W. Ukovich, \u201cA mathematical model for periodic scheduling problems,\u201d SIAM Journal of Discrete Mathematics, 2(4), 550\u2013581 (1986).","journal-title":"SIAM Journal of Discrete Mathematics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-1639-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-005-1639-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-1639-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T07:45:47Z","timestamp":1683099947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-005-1639-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["1639"],"URL":"https:\/\/doi.org\/10.1007\/s10951-005-1639-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}