{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:23:04Z","timestamp":1743142984993,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642213106"},{"type":"electronic","value":"9783642213113"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21311-3_12","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"117-130","source":"Crossref","is-referenced-by-count":3,"title":["Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks"],"prefix":"10.1007","author":[{"given":"Asma","family":"Lahimer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Lopez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Haouari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Beck, J.C., Perron, L.: Discrepancy-bounded depth first search. In: Proceedings of CPAIOR 2000, pp. 8\u201310 (2000)"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.cie.2010.11.015","volume":"60","author":"A. Ben Hmida","year":"2010","unstructured":"Ben Hmida, A., Haouari, M., Huguet, M.-J., Lopez, P.: Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search. Computers and Industrial Engineering\u00a060(2), 320\u2013327 (2010)","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1504\/EJIE.2007.014110","volume":"1","author":"A. Ben Hmida","year":"2007","unstructured":"Ben Hmida, A., Huguet, M.-J., Lopez, P., Haouari, M.: Climbing depth-bounded discrepancy search for solving hybrid flow shop scheduling problems. European Journal of Industrial Engineering\u00a01(2), 223\u2013243 (2007)","journal-title":"European Journal of Industrial Engineering"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0377-2217(03)00434-X","volume":"159","author":"S. Bertel","year":"2004","unstructured":"Bertel, S., Billaut, J.-C.: A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research\u00a0159(3), 651\u2013662 (2004)","journal-title":"European Journal of Operational Research"},{"key":"12_CR5","first-page":"34","volume":"16","author":"G. Brooks","year":"1965","unstructured":"Brooks, G., White, C.: An algorithm for finding optimal or near optimal solutions to the production scheduling problem. Journal of Industrial Engineering\u00a016, 34\u201340 (1965)","journal-title":"Journal of Industrial Engineering"},{"key":"12_CR6","doi-asserted-by":"publisher","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. Naval Research Logistics\u00a046, 57\u201374 (1999)","journal-title":"Naval Research Logistics"},{"key":"12_CR7","unstructured":"Dongarra, J.: Performance of various computers using standard linear equations software. Technical report, University of Tennessee (2009)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Ercan, M.F., Fung, Y.-F.: Real-time image interpretation on a multi-layer architecture. In: Proceedings of IEEE TENCON 1999, pp. 1303\u20131306 (1999)","DOI":"10.1109\/TENCON.1999.818668"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Mathematical Programming\u00a098, 23\u201347 (2003)","journal-title":"Mathematical Programming"},{"key":"12_CR10","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), Montr\u00e9al, Qu\u00e9bec, Canada, vol.\u00a01, pp. 607\u2013615 (August 1995)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10852-008-9101-1","volume":"8","author":"A. Jouglet","year":"2009","unstructured":"Jouglet, A., O\u011fuz, C., Sevaux, M.: Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search. Journal of Mathematical Modelling and Algorithms\u00a08, 271\u2013292 (2009)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"12_CR12","first-page":"347","volume-title":"Industrial Scheduling","author":"J.E. Kelley Jr","year":"1963","unstructured":"Kelley Jr, J.E.: The critical-path method: Resources planning and scheduling. In: Thompson, G.L., Muth, J.F. (eds.) Industrial Scheduling, pp. 347\u2013365. Prentice-Hall, Englewood Cliffs (1963)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/978-3-540-74970-7_63","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"Z. Kiziltan","year":"2007","unstructured":"Kiziltan, Z., Lodi, A., Milano, M., Parisini, F.: CP-based local branching. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 847\u2013855. Springer, Heidelberg (2007)"},{"key":"12_CR14","unstructured":"Korf, R.E.: Improved limited discrepancy search. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), Portland, OR, vol.\u00a01, pp. 286\u2013291 (August 1996)"},{"key":"12_CR15","unstructured":"Milano, M., Roli, A.: On the relation between complete and incomplete search: an informal discussion. In: Proceedings of CPAIOR 2002, Le Croisic, France, pp. 237\u2013250 (2002)"},{"key":"12_CR16","doi-asserted-by":"publisher","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. Journal of Scheduling\u00a08, 323\u2013351 (2005)","journal-title":"Journal of Scheduling"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"O\u011fuz, C., Fung, Y.-F., Ercan, M.F., Qi, X.-T.: Parallel genetic algorithm for a flow shop problem with multiprocessor tasks. In: International Conference on Computational Science, Berlin, Heidelberg, pp. 548\u2013559 (2003)","DOI":"10.1007\/3-540-44863-2_54"},{"key":"12_CR18","doi-asserted-by":"publisher","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., Ha Do, V., Janiak, A., Lichtenstein, M.: Hybrid flow shop scheduling problems with multiprocessor task systems. European Journal of Operational Research\u00a0152, 115\u2013133 (2004)","journal-title":"European Journal of Operational Research"},{"key":"12_CR19","unstructured":"Prosser, P., Unsworth, C.: LDS: testing the hypothesis. Technical Report DCS TR-2008-273, Dept of Computing Science, University of Glasgow (2008)"},{"issue":"5","key":"12_CR20","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1057\/palgrave.jors.2601716","volume":"55","author":"F.S. \u015eerifo\u011flu","year":"2004","unstructured":"\u015eerifo\u011flu, F.S., Ulusoy, G.: Multiprocessor task scheduling in multistage hybrid flow-shops: A genetic algorithm approach. European Journal of Operational Research\u00a055(5), 504\u2013512 (2004)","journal-title":"European Journal of Operational Research"},{"issue":"16","key":"12_CR21","doi-asserted-by":"publisher","first-page":"3161","DOI":"10.1080\/00207540500536939","volume":"44","author":"F.S. \u015eerifo\u011flu","year":"2006","unstructured":"\u015eerifo\u011flu, F.S., Ulusoy, G.: Multiprocessor task scheduling in multistage hybrid flow-shops: An ant colony system approach. International Journal of Production Research\u00a044(16), 3161\u20133177 (2006)","journal-title":"International Journal of Production Research"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0377-2217(93)E0294-8","volume":"80","author":"A. Sprecher","year":"1995","unstructured":"Sprecher, A., Kolisch, R., Drexl, A.: Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research\u00a080(1), 94\u2013102 (1995)","journal-title":"European Journal of Operational Research"},{"key":"12_CR23","unstructured":"Walsh, T.: Depth-bounded discrepancy search. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), Nagoya, Japan, vol.\u00a02, pp. 1388\u20131395 (August 1997)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21311-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T11:20:01Z","timestamp":1741173601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}