{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T03:16:26Z","timestamp":1784171786938,"version":"3.55.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,1,21]],"date-time":"2009-01-21T00:00:00Z","timestamp":1232496000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10852-008-9101-1","type":"journal-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T07:09:47Z","timestamp":1232435387000},"page":"271-292","source":"Crossref","is-referenced-by-count":23,"title":["Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search"],"prefix":"10.1007","volume":"8","author":[{"given":"Antoine","family":"Jouglet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ceyda","family":"O\u011fuz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Sevaux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,1,21]]},"reference":[{"key":"9101_CR1","doi-asserted-by":"crossref","first-page":"3305","DOI":"10.1023\/A:1018995000688","volume":"92","author":"Ph. Baptiste","year":"1999","unstructured":"Baptiste, Ph., Le\u00a0Pape, C., Nuijten, W.: Satisfiability tests and time bound adjustments for cumulative scheduling problems. Ann. Oper. Res. 92, 3305\u20133333 (1999)","journal-title":"Ann. Oper. Res."},{"key":"9101_CR2","volume-title":"Constraint-Based Scheduling, Applying Constraint Programming to Scheduling Problems, vol.\u00a039. International Series in Operations Research and Management Science","author":"Ph. Baptiste","year":"2001","unstructured":"Baptiste, Ph., Le\u00a0Pape, C., Nuijten, W.: Constraint-Based Scheduling, Applying Constraint Programming to Scheduling Problems, vol.\u00a039. International Series in Operations Research and Management Science. Kluwer, Deventer (2001)"},{"key":"9101_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04363-9","volume-title":"Scheduling Computer and Manufacturing Processes","author":"J. B\u0142a\u017cewicz","year":"2001","unstructured":"B\u0142a\u017cewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., W\u0229glarz, J.: Scheduling Computer and Manufacturing Processes, 2nd edn. Springer, Berlin (2001)","edition":"2"},{"key":"9101_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"C. Carlier","year":"1990","unstructured":"Carlier, C., Pinson, E.: A practical use of jackson\u2019s preemptive schedule for solving the job-shop problem. Ann. Oper. Res. 26, 269\u2013287 (1990)","journal-title":"Ann. Oper. Res."},{"key":"9101_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:2000103","volume":"34","author":"J. Carlier","year":"2000","unstructured":"Carlier, J., N\u00e9ron, E.: An exact method for solving the multiprocessor flowshop. RAIRO-RO 34, 1\u201325 (2000)","journal-title":"RAIRO-RO"},{"key":"9101_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H","volume":"46","author":"J. Chen","year":"1999","unstructured":"Chen, J., Lee, C.-Y.: General multiprocessor task scheduling. Nav. Res. Logist. 46, 57\u201374 (1999)","journal-title":"Nav. Res. Logist."},{"issue":"3","key":"9101_CR7","first-page":"7","volume":"5","author":"J. Erschler","year":"1991","unstructured":"Erschler, J., Lopez, P., Thuriot, C.: Raisonnement temporel sous contraintes de ressource et probl\u00e8mes d\u2019ordonnancement. Rev. Intell. Artif. 5(3), 7\u201332 (1991)","journal-title":"Rev. Intell. Artif."},{"key":"9101_CR8","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Redwood City (1989)"},{"key":"9101_CR9","first-page":"69","volume-title":"Foundations of Genetic Algorithms","author":"D.E. Goldberg","year":"1991","unstructured":"Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins, G.J.E. (ed.) Foundations of Genetic Algorithms, pp. 69\u201393. Morgan Kaufman, San Mateo (1991)"},{"issue":"4","key":"9101_CR10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"J.N.D. Gupta","year":"1988","unstructured":"Gupta, J.N.D.: Two stage hybrid flowshop scheduling problem. J. Oper. Res. Soc. 39(4), 359\u2013364 (1988)","journal-title":"J. Oper. Res. Soc."},{"key":"9101_CR11","volume-title":"Adaption in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaption in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"9101_CR12","volume-title":"Ilog Scheduler Reference Manual","author":"Ilog","year":"2004","unstructured":"Ilog: Ilog Scheduler Reference Manual. Ilog, Gentilly (2004)"},{"key":"9101_CR13","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TC.1985.1676647","volume":"34","author":"H. Krawczyk","year":"1985","unstructured":"Krawczyk, H., Kubale, M.: An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Comput. 34, 869\u2013872 (1985)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"9101_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Pape Le","year":"1994","unstructured":"Le\u00a0Pape, C.: Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems. Intell. Syst. Eng. 3(2), 55\u201366 (1994)","journal-title":"Intell. Syst. Eng."},{"key":"9101_CR15","first-page":"445","volume":"31","author":"C.-Y. Lee","year":"1999","unstructured":"Lee, C.-Y., Cai, X.: Scheduling one and two-processor tasks on two parallel processors. IIE Trans. 31, 445\u2013455 (1999)","journal-title":"IIE Trans."},{"key":"9101_CR16","unstructured":"Lhomme, O.: Consistency techniques for numeric CSPs. In: Thirteenth International Joint Conference on Artificial Intelligence, Chamb\u00e9ry, August 1993"},{"issue":"6","key":"9101_CR17","first-page":"453","volume":"26","author":"P. Lopez","year":"1992","unstructured":"Lopez, P., Erschler, J., Esquirol, P.: Ordonnancement de t\u00e2ches sous contraintes: une approche \u00e9nerg\u00e9tique. RAIRO Autom. Prod. Inform. Ind. 26(6), 453\u2013481 (1992)","journal-title":"RAIRO Autom. Prod. Inform. Ind."},{"key":"9101_CR18","unstructured":"Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Technical Report C3P 826, Caltech Concurrent Computation Program, (1989)"},{"key":"9101_CR19","first-page":"219","volume-title":"New Ideas in Optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P.: Memetic algorithms: a short introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 219\u2013234. McGraw-Hill, New York (1999)"},{"key":"9101_CR20","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of Metaheuristics","author":"P. Moscato","year":"2003","unstructured":"Moscato, P., Cotta, C.: A gentle introduction to memetic algorithms. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 105\u2013144. Kluwer, Deventer (2003)"},{"key":"9101_CR21","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0305-0483(01)00040-8","volume":"29","author":"E. N\u00e9ron","year":"2001","unstructured":"N\u00e9ron, E., Baptiste, Ph., Gupta, J.N.D.: Solving hybrid flow shop problem using energetic reasoning and global operations. Omega 29, 501\u2013511 (2001)","journal-title":"Omega"},{"key":"9101_CR22","unstructured":"Nuijten, W.: Time and resource constrained scheduling: a constraint satisfaction approach. Ph.D. thesis, Eindhoven University of Technology (1994)"},{"issue":"2","key":"9101_CR23","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","volume":"90","author":"W. Nuijten","year":"1996","unstructured":"Nuijten, W., Aarts, E.H.L.: A computational study of constraint satisfaction for multiple capacitated job-shop scheduling. Eur. J. Oper. Res. 90(2), 269\u2013284 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9101_CR24","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10951-005-1640-y","volume":"8","author":"C. O\u011fuz","year":"2005","unstructured":"O\u011fuz, C., Ercan, M.F.: A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. J. Sched. 8(4), 323\u2013351 (2005)","journal-title":"J. Sched."},{"key":"9101_CR25","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(02)00766-X","volume":"149","author":"C. O\u011fuz","year":"2003","unstructured":"O\u011fuz, C., Ercan, M.F., Cheng, T.C.E., Fung, Y.-F.: Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. Eur. J. Oper. Res. 149, 390\u2013403 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9101_CR26","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0377-2217(02)00644-6","volume":"152","author":"C. O\u011fuz","year":"2004","unstructured":"O\u011fuz, C., Zinder, Y., Do, V.H., Janiak, A., Lichtenstein, M.: Hybrid flow-shop scheduling problems with multiprocessor task systems. Eur. J. Oper. Res. 152, 115\u2013131 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9101_CR27","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0377-2217(97)00333-0","volume":"107","author":"M.-C. Portmann","year":"1998","unstructured":"Portmann, M.-C., Vignier, A., Dardilhac, D., Dezalay, D.: Branch and bound crossed with GA to solve hybrid flow shops. Eur. J. Oper. Res. 107, 389\u2013400 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9101_CR28","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1057\/palgrave.jors.2601716","volume":"55","author":"F.S. Serifo\u011flu","year":"2004","unstructured":"Serifo\u011flu, F.S., Ulusoy, G.: Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach. J. Oper. Res. Soc. 55(5), 504\u2013512 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"9101_CR29","unstructured":"Vignier, A.: Contribution \u00e0 la R\u00e9solution des Probl\u00e8mes d\u2019Ordonnancement de type Monogamme, Multimachines Flow-shop hybride. Ph.D. thesis, University of Tours (1997)"},{"key":"9101_CR30","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1051\/ro:1999108","volume":"33","author":"A. Vignier","year":"1999","unstructured":"Vignier, A., Billaut, J.-C., Proust, C.: Hybrid flowshop scheduling problems: state of the art. Rairo-Rech. Oper.-Oper. Res. 33, 117\u2013183 (1999)","journal-title":"Rairo-Rech. Oper.-Oper. Res."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9101-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-008-9101-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9101-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T20:51:00Z","timestamp":1589489460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-008-9101-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,21]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9101"],"URL":"https:\/\/doi.org\/10.1007\/s10852-008-9101-1","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,21]]}}}