Review on hybrid flow shop scheduling

Proceedings - 2011 International Conference of Information Technology, Computer Engineering and Management Sciences, ICM 2011

Volumn 4, Issue , 2011, Pages 7-10

  Wang, Wenpeng ^a  

^a QINGDAO UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Branch and Bound; Complexity; Heuristic; Hybrid flow shop; Intelligent search algorithm

Indexed keywords

BRANCH AND BOUNDS; COMPLEXITY; HEURISTIC; HYBRID FLOW SHOP; INTELLIGENT SEARCH ALGORITHM;

APPROXIMATION ALGORITHMS; LINEAR PROGRAMMING; MANAGEMENT SCIENCE; MANUFACTURE; SCHEDULING;

INFORMATION TECHNOLOGY;

EID: 84863027005     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICM.2011.219     Document Type: Conference Paper

References (32)

1. I.Ribas, R.Leisten and J.M. Framiñan, "Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective", Computers & Operations Research, vol.37, Aug.2010, pp.1439-1454.
2. S.Keshavarzmanesh, L.H.Wang, Hs.Y.Feng, "A hybrid approach for dynamic routing planning in an automated assembly shop", Robotics and Computer-Integrated Manufacturing", vol.26, Dec.2010, pp.768-777.
3. R.Ruiz, J.Antonio and Vázquez-Rodríguez,"The hybrid flow shop scheduling problem", European Journal of Operational Research, vol.205, Aug.2010,pp.1-18.
4. A.Guinet, M.M.Solomon, P.K.Kedia and A.Dussauchoy, "A computational study of heuristics for two-stage flexible flow shop"s, Journal of Operational Research, vol.34, May.1996, pp.1399-1415. (Pubitemid 126525266)
5. J.N.D.Gupta and E.A.Tunc, "Scheduling for a two-stage hybrid flow shop with parallel machines at the second stage", International Journal of Production Research,vol.29,Jul.1991,pp.1489-1502.
6. H.S.Choi, D.H.Lee, "Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops", Computers & Industrial Engineering, vol.56, Feb.2009, pp.113-120.
7. L.Wang, Q.K.Pan and M.F.Tasgetiren, "Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms", Expert Systems with Applications, vol.37, Dec.2010, pp.7929-7936.
8. J.Yang, "Minimizing total completion time in two-stage hybrid flow shop with dedicated machines", Computers & Operations Research, vol.38, Jul.2011,pp.1045-1053.
9. J.N.D.Gupta, K.Henning and F.Werner, "Local search heuristics for two-stage flow shop problems with secondary criterion", Computers and Operations Research, vol.29, Feb.2002, pp.123-149. (Pubitemid 32944292)
10. L.H.Su, "A hybrid two-stage flow shop with limited waiting time constraints", Computers and Industrial Engineering, vol.44, Mar.2003, pp.409-424.
11. L.H.Su and P.C. Chang, "A heuristic to minimize a quadratic function of job lateness on a single machine", International Journal of Production Economics,vol.55, Jul.2003, pp.169-175.
12. J.N.D.Gupta and E.A.Tunc, "Scheduling a two-stage hybrid flow shop with separable setup and removal times", European Journal of Operational Research, vol.77,Sep.1994,pp. 415-428.
13. H.Djellab and K. Djellab, "Preemptive hybrid flow shop scheduling problem of interval orders", European Journal of Operational Research, vol.137, Feb.2002, pp.37-49. (Pubitemid 33126009)
14. I.G.Drobouchevitch and V.A.Strusevich, "Two-stage open shop scheduling with a bottleneck machine", European Journal of Operational Research, vol.128, Jan.2001, pp.159-174. (Pubitemid 32022968)
15. L.Hidri and M.Haouari, "Bounding strategies for the hybrid flow shop scheduling problem", Applied Mathematics and Computation, vol.217, Jul.2011, pp.8248-8263.
16. M.R.Amin-Naseri, M.A.Beheshti-Nia, "Hybrid flow shop scheduling with parallel batching", International Journal of Production Economics, vol.117, Jan.2009, pp.185-196.
17. F.Riane, A.Artiba and S.E.Elmaghraby, "A hybrid three-stage flow shop problem: Efficient heuristics to minimize makespan", European Journal of Operational Research, vol.109, Sep.1998, pp.321-329. (Pubitemid 128417835)
18. L.Mönch and J.Zimmermann, "Simulation-based assessment of machine criticality measures for a shifting bottleneck scheduling approach in complex manufacturing systems", Computers in Industry, vol.58, Sep.2007, pp.644-655. (Pubitemid 47058182)
19. C.Kahraman, O.Engin, ihsan Kaya and R.E.Öztürk, "Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach", Applied Soft Computing, vol.10, Sep.2010, pp.1293-1300.
20. H.W.Thornton, J.L.Hunsucker, "A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage", European Journal of Operational Research, vol.152, Jan.2004, pp.96-114.
21. C.Koulamas and G.J.Kyparisis, "The three-stage assembly flow shop scheduling problem", Computers and Operations Research, vol.28, Jun.2001, pp.689-704. (Pubitemid 32379144)
22. M.C.Portmann, A.Vignier, D.Dardilhac and D.Dezalay., Branch and bound crossed with GA to solve hybrid flow shop, European Journal of Operational Research,Vol.107, Jun.1998, pp.389-400. (Pubitemid 128407552)
23. Botta-Genoulaz V., Hybrid flow shop scheduling with precedence constrains and time lags to minimize maximum lateness, International Journal of Production Economics, vol.64, Mar.2000, pp.101-111. (Pubitemid 30557647)
24. A.B.Hmida, M.Haouari, M.J.Huguet and P.Lopez, "Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search", Computers & Industrial Engineering, vol.60, Mar.2011, pp.320-327.
25. E.Néron, P.Baptiste, J.N.D. Gupta, "Solving hybrid flow shop problem using energetic reasoning and global operations", Omega,vol.29, Dec.2001, pp.501-511. (Pubitemid 33628766)
26. C.Oǧuz, M.F.Ercan, T.C.Edwin Cheng and Y.F.Fung, "Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow shop" ,European Journal of Operational Research, vol.149, Sep.2003, pp.390-403.
27. S.Khalouli, F.Ghedjati and A.Hamzaoui,"A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop",Engineering Applications of Artificial Intelligence, vol.23, Aug.2010, pp.765-771.
28. L.Y. Tseng and Y.T.Lin, "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem",European Journal of Operational Research, vol.198, Oct.2009,pp.84-92.
29. E.Figielska, "A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources", Computers & Industrial Engineering, vol.56, Feb.2009, pp,142-151.
30. C.Y. Wang, X.P.Li and Q.Wang, "Accelerated tabu search for nowait flowshop scheduling problem with maximum lateness criterion" European Journal of Operational Research, vol.206, Oct.2010, pp.64-72.
31. M.S.Jorge Valente and Rui A.F.S. Alves, "Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups", Computers & Operations Research, vol.35, Jul.2008, pp.2388-2405. (Pubitemid 350161143)
32. R.Linn and W.Zhang, "Hybrid Flow Shop Scheduling: a Survey", Computer & Industrial Engineering, vol.37, Sep.1999, pp.57-61.