{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:34:21Z","timestamp":1776976461763,"version":"3.51.4"},"reference-count":22,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T00:00:00Z","timestamp":1548892800000},"content-version":"vor","delay-in-days":30,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2017,11,3]]},"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>Conventionally, in scheduling problems it is assumed that each job visits each machine once. This paper studies a novel shop scheduling called cycle shop problems where jobs might return to each machine more than once. The problem is first formulated by two mixed integer linear programming models. The characteristics of the problem are analyzed, and it is realized that the problem suffers from a shortcoming called redundancy, <jats:italic>i.e.<\/jats:italic>, several sequences represents the same schedule. In this regard, some properties are introduced by which the redundant sequences can be recognized before scheduling. Three constructive heuristics are developed. They are based on the shortest processing time first, insertion neighborhood search and non-delay schedules. Then, a metaheuristic based on scatter search is proposed. The algorithms are equipped with the redundancy prevention properties that greatly reduce the computational time of the algorithms. Two sets of experiments are conducted. The proposed model and algorithms are evaluated. The results show the high performance of model and algorithms.<\/jats:p>","DOI":"10.1051\/ro\/2017086","type":"journal-article","created":{"date-parts":[[2017,11,7]],"date-time":"2017-11-07T07:40:22Z","timestamp":1510040422000},"page":"111-128","source":"Crossref","is-referenced-by-count":2,"title":["The cycle shop scheduling: mathematical model, properties and solution algorithms"],"prefix":"10.1051","volume":"53","author":[{"given":"Bahman","family":"Naderia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheida","family":"Goharib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,1,31]]},"reference":[{"key":"R1","unstructured":"Baker K.J., \nIntroduction to Sequencing and Scheduling. \nWiley, \nNewYork, USA \n(1974)."},{"key":"R2","unstructured":"B\u0142azewicz J., \nEcker K.H., \nPesch E., \nSchmidt G. and \nWeglarz J., \nHandbook of Scheduling: From Theory to Applications. \nSpringer, \nGermany \n(2007)."},{"key":"R3","unstructured":"Bruker P. and \nKampmeyer T., Tabu search algorithms for cyclic machine scheduling problems, in \nThe Fifth Metaheuristics International Conference, Japan \n(2003)."},{"key":"R4","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.orl.2003.10.012","volume":"33","author":"Che","year":"2005","journal-title":"Oper. Res. Lett"},{"key":"R5","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1016\/j.eswa.2007.02.027","volume":"34","author":"Chen","year":"2008","journal-title":"Expert Syst. Appl"},{"key":"R6","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/j.eswa.2006.09.021","volume":"34","author":"Chen","year":"2008","journal-title":"Expert Syst. Appl."},{"key":"R7","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.cie.2011.04.008","volume":"61","author":"Cho","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"R8","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2009.06.031","volume":"203","author":"Dugardin","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R9","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"Gao","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"4530","DOI":"10.1016\/j.asoc.2011.08.013","volume":"11","author":"Hekmatfar","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"R11","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1007\/s00170-006-0736-7","volume":"35","author":"Kang","year":"2007","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.ejor.2014.05.024","volume":"239","author":"Naderi","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"R13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1504\/EJIE.2012.045604","volume":"6","author":"Naderi","year":"2012","journal-title":"Eur. J. Ind. Eng."},{"key":"R14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.cor.2009.04.017","volume":"37","author":"Naderi","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"key":"R16","unstructured":"Nose K., \nHiramatsu A. and \nKonishi M., Using genetic algorithm for job-shop scheduling problems with reentrant product flows, in \n7th IEEE International Conference on Emerging Technologies and Factory Automation, Spain \n(1999)."},{"key":"R17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1080\/00207729708929360","volume":"28","author":"Pan","year":"1997","journal-title":"Int. J. Syst. Sci."},{"key":"R18","unstructured":"Pinedo M., \nScheduling Theory, Algorithms, and Systems, 3rd edn. \nLLC, Springer, \nNew York \n(2008)."},{"key":"R19","unstructured":"Ross R.J., \nTaguchi Techniques for Quality Engineering. \nMcGraw-Hill, \nUSA \n(1989)."},{"key":"R20","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/s00170-008-1881-y","volume":"44","author":"Topaloglu","year":"2009","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/07408179208964233","volume":"24","author":"Uzsoy","year":"1992","journal-title":"IIE Trans."},{"key":"R22","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s00170-011-3204-y","volume":"56","author":"Xie","year":"2011","journal-title":"Int. J. Adv. Manuf. Technol."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017086\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:37:12Z","timestamp":1584689832000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":22,"journal-issue":{"issue":"1"},"alternative-id":["ro170056"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2017086","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}