{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:31:23Z","timestamp":1725514283415},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681052"},{"type":"electronic","value":"9783540681113"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68111-3_63","type":"book-chapter","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:27:12Z","timestamp":1211992032000},"page":"608-617","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Flowshop with Unrelated Machines, Sequence Dependent Setup Time and Availability Constraints: An Enhanced Crossover Operator for a Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Victor","family":"Yaurima","sequence":"first","affiliation":[]},{"given":"Larisa","family":"Burtseva","sequence":"additional","affiliation":[]},{"given":"Andrei","family":"Tchernykh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"63_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1299\/jsmec.48.46","volume":"48","author":"H. Morita","year":"2005","unstructured":"Morita, H., Shio, N.: Hybrid Branch and Bound Method with Genetic Algorithm for Flexible Flowshop Scheduling Problem. JSME International Journal, Series C\u00a048(1), 46\u201352 (2005)","journal-title":"JSME International Journal, Series C"},{"issue":"4","key":"63_CR2","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0278-6125(87)90006-9","volume":"6","author":"S. Kochhar","year":"1987","unstructured":"Kochhar, S., Morris, R.: Heuristic Method for Flexible Flow Line Scheduling. J. Manufacturing Systems\u00a06(4), 299\u2013314 (1987)","journal-title":"J. Manufacturing Systems"},{"key":"63_CR3","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0377-2217(93)E0326-S","volume":"80","author":"D. Santos","year":"1995","unstructured":"Santos, D., Hunsucker, J., Deal, D.: Global Lower Bounds for Flow Shops with Multiple Processors. European J. Operational Research\u00a080, 112\u2013120 (1995)","journal-title":"European J. Operational Research"},{"issue":"9","key":"63_CR4","doi-asserted-by":"publisher","first-page":"2463","DOI":"10.1080\/002075498192634","volume":"36","author":"E. Aghezzaf","year":"1998","unstructured":"Aghezzaf, E., Artiba, A.: Aggregate Planning in Hybrid Flowshops. Int. J. Production Research\u00a036(9), 2463\u20132477 (1998)","journal-title":"Int. J. Production Research"},{"issue":"6","key":"63_CR5","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1080\/00207549608904988","volume":"34","author":"A. Guinet","year":"1996","unstructured":"Guinet, A., Solomon, M.: Scheduling Hybrid Flowshops to Minimize Maximum Tardiness or Maximum Completion Time. Int. J. Production Research\u00a034(6), 1643\u20131654 (1996)","journal-title":"Int. J. Production Research"},{"issue":"9","key":"63_CR6","doi-asserted-by":"publisher","first-page":"2397","DOI":"10.1080\/002075498192599","volume":"36","author":"J. Gupta","year":"1998","unstructured":"Gupta, J., Tunc, E.: Minimizing Tardy Jobs in a Two-Stage Hybrid Flowshop. Int. J. Production Research\u00a036(9), 2397\u20132417 (1998)","journal-title":"Int. J. Production Research"},{"key":"63_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0377-2217(97)00333-0","volume":"107","author":"M. Portmann","year":"1998","unstructured":"Portmann, M., Vignier, A.: Branch and Bound Crossed with GA to Solve Hybrid Flowshops. European J. Operational Research\u00a0107, 389\u2013400 (1998)","journal-title":"European J. Operational Research"},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0377-2217(98)00060-5","volume":"109","author":"F. Riane","year":"1998","unstructured":"Riane, F., Artiba, A., Elmaghraby, S.: A Hybrid Three-Stage Flowshop Problem: Efficient Heuristics to Minimize Makespan. European J. Operational Research\u00a0109, 321\u2013329 (1998)","journal-title":"European J. Operational Research"},{"issue":"4","key":"63_CR9","first-page":"10","volume":"8","author":"L. Arthanary","year":"1971","unstructured":"Arthanary, L., Ramaswamy, K.: An Extension of Two Machine Sequencing Problem. OPSEARCH. The Journal of the Operational Research Society of India\u00a08(4), 10\u201322 (1971)","journal-title":"OPSEARCH. The Journal of the Operational Research Society of India"},{"key":"63_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-642-80784-8_7","volume-title":"Symposium of the Theory of Scheduling and Applications","author":"M. Salvador","year":"1973","unstructured":"Salvador, M.: A solution to a special case of flow shop scheduling problems. In: Elmaghraby, S.E. (ed.) Symposium of the Theory of Scheduling and Applications, pp. 83\u201391. Springer, New York (1973)"},{"key":"63_CR11","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/j.ejor.2004.06.038","volume":"169","author":"R. Ruiz","year":"2006","unstructured":"Ruiz, R., Maroto, C.: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European J. Operational Research\u00a0169, 781\u2013800 (2006)","journal-title":"European J. Operational Research"},{"issue":"2","key":"63_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1051\/ro:1999108","volume":"33","author":"A. Vignier","year":"1999","unstructured":"Vignier, A., Billaut, J., Proust, C.: Les Problmes D\u2019Ordonnancement de Type Flow-Shop Hybride: tat de L\u2019Art. RAIRO Recherche op\u00e9rationnelle\u00a033(2), 117\u2013183 (1999)","journal-title":"RAIRO Recherche op\u00e9rationnelle"},{"key":"63_CR13","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.cie.2004.09.002","volume":"47","author":"H. Allaoui","year":"2004","unstructured":"Allaoui, H., Artiba, A.: Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers & Industrial Engineering\u00a047, 431\u2013450 (2004)","journal-title":"Computers & Industrial Engineering"},{"key":"63_CR14","unstructured":"Aghezzaf, E., Artiba, A., Moursli, O., Tahon, C.: Hybrid flowshop problems, a decomposition based heuristic approach. In: Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM 1995, Marrakech. FUCAM \u2013 INRIA, pp. 43\u201356 (1995)"},{"key":"63_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.amc.2005.11.136","volume":"180","author":"M. Zandieh","year":"2006","unstructured":"Zandieh, M., Fatemi Ghomi, S., Moattar Husseini, S.: An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation\u00a0180, 111\u2013127 (2006)","journal-title":"Applied Mathematics and Computation"},{"key":"63_CR16","unstructured":"Gourgand, M., Grangeon, N., Norre, S.: Metaheuristics for the deterministic hybrid flow shop problem. In: Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM 1999, Glasgow. FUCAM - INRIA, pp. 136\u2013145 (1999)"},{"issue":"4","key":"63_CR17","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/opre.41.4.641","volume":"41","author":"L. Adler","year":"1993","unstructured":"Adler, L., Fraiman, N., Kobacker, E., Pinedo, M., Plotnicoff, J., Wu, T.P.: BPSS: A Scheduling Support System for the Packaging Industry. Operations Research\u00a041(4), 641\u2013648 (1993)","journal-title":"Operations Research"},{"key":"63_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1007\/11427391_126","volume-title":"Advances in Neural Networks \u2013 ISNN 2005","author":"L. Tang","year":"2005","unstructured":"Tang, L., Zhang, Y.: Heuristic Combined Artificial Neural Networks to Schedule Hybrid Flow Shop with Sequence Dependent Setup Times. In: Wang, J., Liao, X.-F., Yi, Z. (eds.) ISNN 2005. LNCS, vol.\u00a03496, pp. 788\u2013793. Springer, Heidelberg (2005)"},{"key":"63_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-3-540-24650-3_15","volume-title":"Genetic Programming","author":"E. Ryan","year":"2004","unstructured":"Ryan, E., Azad, R.M.A., Ryan, C.: On the Performance of Genetic Operators and the Random Key Representation. In: Genetic Programming. LNCS, vol.\u00a02003\/2004, pp. 162\u2013173. Springer, Heidelberg (2004)"},{"key":"63_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/09537289008919291","volume":"1","author":"H. Sherali","year":"1990","unstructured":"Sherali, H., Sarin, S., Kodialam, M.: Models and algorithms for a two-stage production process. Production Planning and Control\u00a01, 27\u201339 (1990)","journal-title":"Production Planning and Control"},{"key":"63_CR21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0377-2217(92)90310-6","volume":"57","author":"C. Rajendran","year":"1992","unstructured":"Rajendran, C., Chaudhuri, D.: A multi-stage parallel processor flowshop problem with minimum flowtime. European J. Operational Research\u00a057, 11\u2013122 (1992a)","journal-title":"European J. Operational Research"},{"key":"63_CR22","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1057\/palgrave.jors.2601563","volume":"54","author":"J. Alcaraz","year":"2003","unstructured":"Alcaraz, J., Maroto, C., Ruiz, R.: Solving the multi-mode resource-contraints project scheduling problem with genetic algorithms. Journal of the Operational Research Society\u00a054, 614\u2013626 (2003)","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"63_CR23","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C. Reeves","year":"1995","unstructured":"Reeves, C.: A genetic algorithm for flowshop sequencing. Computers & Operations Research\u00a022(1), 5\u201313 (1995)","journal-title":"Computers & Operations Research"},{"key":"63_CR24","volume-title":"Genetic Algorithms in Search, optimization and Machine Learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D.: Genetic Algorithms in Search, optimization and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"63_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolutions Programs","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolutions Programs, 3rd edn. Springer, Heidelberg (1996)","edition":"3"},{"key":"63_CR26","first-page":"512","volume-title":"Genetic algorithms & engineering optimization","author":"M. Gen","year":"1997","unstructured":"Gen, M., Cheng, R.: Genetic algorithms & engineering optimization, p. 512. John Wiley & Sons, New York (1997)"},{"key":"63_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-61723-X_995","volume-title":"Parallel Problem Solving from Nature - PPSN IV","author":"C. Bierwirth","year":"1996","unstructured":"Bierwirth, C., Mattfeld, D., Kopfer, H.: On permutation representations for scheduling problems. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol.\u00a01141, pp. 310\u2013318. Springer, Heidelberg (1996)"},{"issue":"1","key":"63_CR28","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore Jr., E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, The International Journal of Management Science\u00a011(1), 91\u201395 (1983)","journal-title":"OMEGA, The International Journal of Management Science"},{"issue":"6","key":"63_CR29","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I. Osman","year":"1989","unstructured":"Osman, I., Potts, C.: Simulated annealing for permutation flow-shop scheduling. OMEGA, The Int. Journal of Management Science\u00a017(6), 551\u2013557 (1989)","journal-title":"OMEGA, The Int. Journal of Management Science"},{"key":"63_CR30","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","volume":"41","author":"M. Widmer","year":"1989","unstructured":"Widmer, M., Hertz, A.: A new heuristic method for the flowshop sequencing problem. European J. Operational Research\u00a041, 186\u2013193 (1989)","journal-title":"European J. Operational Research"},{"key":"63_CR31","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0377-2217(93)E0228-P","volume":"80","author":"C. Chen","year":"1995","unstructured":"Chen, C., Vempati, V., Aljaber, N.: An application of genetic algorithm for flow shop problems. European J. Operational Research\u00a080, 389\u2013396 (1995)","journal-title":"European J. Operational Research"},{"issue":"4","key":"63_CR32","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","volume":"30","author":"T. Murata","year":"1996","unstructured":"Murata, T., Ishibuchi, H., Tanaka, H.: Genetic algorithms for flowshop scheduling problems. Computers and Industrial Engineering\u00a030(4), 1061\u20131071 (1996)","journal-title":"Computers and Industrial Engineering"},{"key":"63_CR33","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/S0305-0548(02)00068-0","volume":"30","author":"T. Aldowaisan","year":"2003","unstructured":"Aldowaisan, T., Allahvedi, A.: New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research\u00a030, 1219\u20131231 (2003)","journal-title":"Computers & Operations Research"},{"key":"63_CR34","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C. Rajendran","year":"2004","unstructured":"Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. European J. Operational Research\u00a0155, 426\u2013438 (2004)","journal-title":"European J. Operational Research"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68111-3_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:34:57Z","timestamp":1620016497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68111-3_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681052","9783540681113"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68111-3_63","relation":{},"subject":[]}}