Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search

Computers and Industrial Engineering

Volumn 60, Issue 2, 2011, Pages 320-327

  Hmida, Abir Ben ^a   Haouari, Mohamed ^a,b,c   Huguet, Marie José ^d,e   Lopez, Pierre ^d,e  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b OZYEGIN UNIVERSITY   (Turkey)

^c KING SAUD UNIVERSITY   (Saudi Arabia)

^d LAAS CNRS   (France)

^e UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

CDDS; Discrepancy search methods; Heuristics; Lower bounds; Scheduling; Two stage hybrid flow shop

Indexed keywords

CDDS; HEURISTICS; LOWER BOUNDS; SEARCH METHOD; TWO-STAGE HYBRID FLOW SHOP;

SCHEDULING; SCHEDULING ALGORITHMS;

MACHINE SHOP PRACTICE;

EID: 78951480940     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.11.015     Document Type: Article

References (18)

1. A. Ben Hmida, M.-J. Huguet, P. Lopez, and M. Haouari Climbing Discrepancy Search for solving the hybrid Flow shop European Journal of Industrial Engineering 1 2 2007 223 243
2. J. Dongarra Performance of various computers using standard linear equations software 1998 Computer Science Department, University of Tennessee Knoxville, Tennessee
3. A. Guinet, M.M. Solomon, P.K. Kedia, and A. Dussauchoy A computational study of heuristics for two-stage flexible flowshops International Journal of Production Research 34 5 1996 1399 1415
4. J.N.D. Gupta Two-stage hybrid flowshop scheduling problem Journal of the Operational Research Society 39 1988 359 364
5. J.N.D. Gupta, A.M.A. Hariri, and C.N. Potts Scheduling a two-stage hybrid flow shop with parallel machines at the first stage Annals of Operations Research 69 1997 171 191
6. P. Hansen, and N. Mladenovic Variable neighborhood search: Principles and applications European Journal of Operational Research 130 2001 449 467 (Pubitemid 32875304)
7. M. Haouari, L. Hidri, and A. Gharbi Optimal scheduling of a two hybrid flow shop Mathematical Methods of Operations Research 64 2006 107 124
8. M. Haouari, and R. M'Hallah Heuristic algorithms for the two-stage hybrid flowshop problem Operations Research Letters 21 1997 43 53
9. Harvey, W. D. (1995). Nonsystematic backtracking search. Ph.D. thesis, CIRL, University of Oregon.
10. J.A. Hoogeveen, J.K. Lenstra, and B. Veltman Preemptive scheduling in a two-stage multiprocessor flow shop is NP-Hard European Journal of Operational Research 89 1991 172 175
11. C.Y. Lee, and G.L. Vairaktarakis Minimizing makespan in hybrid flow-shop Operations Research Letters 16 1994 149 158
12. H.T. Lin, and C.J. Liao A case study in a two-stage hybrid flowshop with setup time and dedicated machines International Journal of Production Economics 86 2003 133 143
13. Milano, M., and Roli, A. (2002). On the relation between complete and incomplete search: an informal discussion. Proceedings CPAIOR'02 (pp. 237-250), Le Croisic, France.
14. S.L. Narasimhan, and S.S. Panwalker Scheduling in a two-stage manufacturing process International Journal of Production Research 22 1984 555 564
15. R. Ruiz, and J.A. Vázquez-Rodríguez The hybrid flow shop scheduling problem European Journal of Operational Research 205 1 2010 1 18
16. H.D. Sherali, S.C. Sarin, and M.S. Kodialam Models and algorithms for a two-stage production process Production Planning and Control 1 1990 27 39
17. C.T. Tseng, C.J. Liao, and T.X. Liao A note on two-stage hybrid flowshop scheduling with missing operations Computers & Industrial Engineering 54 3 2008 695 704
18. Walsh, T. (1997). Depth-bounded Discrepancy Search". Proceedings IJCAI-97 (pp. 1388-1395), Nagoya, Japan.