Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6697 LNCS, Issue , 2011, Pages 117-130

  Lahimer, Asma ^a,b   Lopez, Pierre ^a,b   Haouari, Mohamed ^c  

^a LAAS CNRS   (France)

^b UNIVERSITÉ PAUL SABATIER   (France)

^c UNIVERSITY OF CARTHAGE   (Tunisia)

Author keywords

Discrepancy search; Hybrid flow shop scheduling; Multiprocessor tasks

Indexed keywords

COMPUTATIONAL RESULTS; COMPUTING SYSTEM; DISCREPANCY SEARCH; FLOW-SHOPS; HYBRID FLOW SHOP SCHEDULING; LARGE SIZES; LOWER BOUNDS; MULTIPROCESSOR TASK SCHEDULING; MULTIPROCESSOR TASKS; NP-HARD; THEORETICAL COMPLEXITY; HYBRID FLOW SHOP;

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; MACHINE SHOP PRACTICE; MULTIPROCESSING SYSTEMS; OPTIMIZATION; SCHEDULING; DISTRIBUTED COMPUTER SYSTEMS;

PROBLEM SOLVING;

EID: 79956319755     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21311-3_12     Document Type: Conference Paper

References (23)

1. Beck, J. C., Perron, L.: Discrepancy-bounded depth first search. In: Proceedings of CPAIOR 2000, pp. 8-10 (2000)
2. 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 60(2), 320-327 (2010)
3. 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 1(2), 223-243 (2007)
4. Bertel, S., Billaut, J.-C.: A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research 159(3), 651-662 (2004)
5. Brooks, G., White, C.: An algorithm for finding optimal or near optimal solutions to the production scheduling problem. Journal of Industrial Engineering 16, 34-40 (1965)
6. Chen, J., Lee, C.-Y.: General multiprocessor task scheduling. Naval Research Logistics 46, 57-74 (1999)
7. Dongarra, J.: Performance of various computers using standard linear equations software. Technical report, University of Tennessee (2009)
8. Ercan, M. F., Fung, Y.-F.: Real-time image interpretation on a multi-layer architecture. In: Proceedings of IEEE TENCON 1999, pp. 1303-1306 (1999)
9. Fischetti, M., Lodi, A.: Local branching. Mathematical Programming 98, 23-47 (2003)
10. Harvey, W. D., Ginsberg, M. L.: Limited discrepancy search. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), Montréal, Québec, Canada, vol. 1, pp. 607-615 (August 1995)
11. Jouglet, A., Oǧuz, C., Sevaux, M.: Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search. Journal of Mathematical Modelling and Algorithms 8, 271-292 (2009)
12. Kelley Jr, J. E.: The critical-path method: Resources planning and scheduling. In: Thompson, G. L., Muth, J. F. (eds.) Industrial Scheduling, pp. 347-365. Prentice-Hall, Englewood Cliffs (1963)
13. Kiziltan, Z., Lodi, A., Milano, M., Parisini, F.: CP-based local branching. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 847-855. Springer, Heidelberg (2007)
14. Korf, R. E.: Improved limited discrepancy search. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), Portland, OR, vol. 1, pp. 286-291 (August 1996)
15. 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-250 (2002)
16. Oǧuz, C., Ercan, M. F.: A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Journal of Scheduling 8, 323-351 (2005) (Pubitemid 40878783)
17. Oǧuz, 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-559 (2003)
18. Oǧuz, C., Zinder, Y., Ha Do, V., Janiak, A., Lichtenstein, M.: Hybrid flow shop scheduling problems with multiprocessor task systems. European Journal of Operational Research 152, 115-133 (2004)
19. Prosser, P., Unsworth, C.: LDS: testing the hypothesis. Technical Report DCS TR-2008-273, Dept of Computing Science, University of Glasgow (2008)
20. Şerifoǧlu, F. S., Ulusoy, G.: Multiprocessor task scheduling in multistage hybrid flow-shops: A genetic algorithm approach. European Journal of Operational Research 55(5), 504-512 (2004)
21. Şlerifoǧlu, F. S., Ulusoy, G.: Multiprocessor task scheduling in multistage hybrid flow-shops: An ant colony system approach. International Journal of Production Research 44(16), 3161-3177 (2006)
22. 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 80(1), 94-102 (1995)
23. Walsh, T.: Depth-bounded discrepancy search. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), Nagoya, Japan, vol. 2, pp. 1388-1395 (August 1997)