{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:18:17Z","timestamp":1772821097455,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,10,24]],"date-time":"2013-10-24T00:00:00Z","timestamp":1382572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10845-013-0841-z","type":"journal-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T13:07:41Z","timestamp":1382533661000},"page":"1085-1098","source":"Crossref","is-referenced-by-count":40,"title":["A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem"],"prefix":"10.1007","volume":"26","author":[{"given":"Amir","family":"Jalilvand-Nejad","sequence":"first","affiliation":[]},{"given":"Parviz","family":"Fattahi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,24]]},"reference":[{"key":"841_CR1","doi-asserted-by":"crossref","unstructured":"Bahroun, Z., Baptiste, P., Campagne, J. P., & Moalla, M. (1999). Production planning and scheduling in the context of cyclic delivery schedules. Computers and Industrial Engineering, 37(1), 3\u20137.","DOI":"10.1016\/S0360-8352(99)00012-1"},{"key":"841_CR2","doi-asserted-by":"crossref","unstructured":"Brucker, P., & Kampmeyer, T. (2008a). A general model for cyclic machine scheduling problems. Discrete Applied Mathematics, 156(13), 2561\u20132572.","DOI":"10.1016\/j.dam.2008.03.029"},{"issue":"1","key":"841_CR3","first-page":"161","volume":"159","author":"P Brucker","year":"2008","unstructured":"Brucker, P., & Kampmeyer, T. (2008b). Cyclic job shop scheduling problem with blocking. Journal of Intelligent Manufacturing, 159(1), 161\u2013181.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"841_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2003.03.001","volume":"161","author":"G Cavory","year":"2005","unstructured":"Cavory, G., Dupas, R., & Goncalves, G. (2005). A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints. European Journal of Operational Research, 161(1), 73\u201385.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"841_CR5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P Fattahi","year":"2007","unstructured":"Fattahi, P., SaidiMehrabad, M., & Jolai, F. (2007). Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. Journal of Intelligent Manufacturing, 18(3), 331\u2013342.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"7","key":"841_CR6","doi-asserted-by":"crossref","first-page":"3076","DOI":"10.1016\/j.apm.2008.10.029","volume":"33","author":"P Fattahi","year":"2009","unstructured":"Fattahi, P., Jolai, F., & Arkat, J. (2009). Flexible job shop scheduling with overlapping in operations. Applied Mathematical Modeling, 33(7), 3076\u20133087.","journal-title":"Applied Mathematical Modeling"},{"issue":"1","key":"841_CR7","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 Operational Research, 72(1), 82\u2013101.","journal-title":"European Journal of Operational Research"},{"key":"841_CR8","volume-title":"Scheduling theory and its applications","author":"C Hanen","year":"1997","unstructured":"Hanen, C., & Munier, A. (1997). Cyclic scheduling on parallel processors: An overview. In P. Chretienne, E. G. Coffman, J. K. Lenstra, & Z. Liu (Eds.), Scheduling theory and its applications. New York: Wiley."},{"issue":"1","key":"841_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","volume":"32","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., & Borne, P. (2002). Approach by localization and multiobjective evolutionary optimization for flexible job shop scheduling problems. IEEE Transactions on Systems, Man and Cybernetics, Part C, 32(1), 1\u201313.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part C"},{"key":"841_CR10","volume-title":"Handbook of scheduling algorithms, models and performance analysis","author":"J Leung","year":"2004","unstructured":"Leung, J. (2004). Handbook of scheduling algorithms, models and performance analysis. Boca Raton, FL, USA: CRC Press."},{"key":"841_CR11","doi-asserted-by":"crossref","unstructured":"Ouenniche, J., & Bertrand, J. W. M. (2001). The finite horizon economic lot sizing problem in job shops: The multiple cycle approach. International Journal of Production Economics, 74(1), 49\u201361.","DOI":"10.1016\/S0925-5273(01)00106-2"},{"issue":"10","key":"841_CR12","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job shop scheduling problem. Computers and Operations Research, 35(10), 3202\u20133212.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"841_CR13","first-page":"496","volume":"3","author":"AA Romanova","year":"2009","unstructured":"Romanova, A. A., & Servakh, V. V. (2009). Optimization of processing identical jobs by means of cyclic schedules. Journal of Intelligent Manufacturing, 3(4), 496\u2013504.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"841_CR14","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/moor.17.4.842","volume":"17","author":"R Roundy","year":"1992","unstructured":"Roundy, R. (1992). Cyclic schedules for job shops with identical jobs. Mathematics of Operations Research, 17(4), 842\u2013865.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"841_CR15","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 shop with blocking. Computers and Industrial Engineering, 34(2), 281\u2013295.","journal-title":"Computers and Industrial Engineering"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-013-0841-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-013-0841-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-013-0841-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:12:00Z","timestamp":1559268720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-013-0841-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,24]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["841"],"URL":"https:\/\/doi.org\/10.1007\/s10845-013-0841-z","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,24]]}}}