Hybrid Flow Shop Scheduling with Availability Constraints

  • Hamid AllaouiEmail author
  • Abdelhakim Artiba
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 200)


The success of a product depends on the costs incurred through its entire processing. Indeed, an efficient schedule can significantly reduce the total costs. Most of the literature on scheduling assumes that machines are always available. However, due to maintenance activities machines cannot operate continuously without some unavailability periods. This chapter deals with scheduling a hybrid flow shop with availability constraints to minimize makespan. We investigate exact methods to solve two special cases of this problem to optimality. We formulate a dynamic programming to solve two-machine flow shop and a branch and bound algorithm to solve the two-stage hybrid flow shop.


Schedule Problem Completion Time Flow Shop Preventive Maintenance Short Processing Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Adler, L., Fraiman, N., Kobacker, E., Pinedo, M., Plotnicoff, J. C. & Wu, T. P. (1993). BPSS: A scheduling support system for the packaging industry. Journal Operations Research, 41, 641–648.CrossRefGoogle Scholar
  2. Allahverdi, A. (1996). Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computer Operations Research, (23-10) 909–916.Google Scholar
  3. Allahverdi, A., & Mittenthal, J. (1998). Dual criteria scheduling on a two-machine flowshop subject to random breakdowns. International Transaction Operational Research, (5–4) 317–324.Google Scholar
  4. Allaoui, H., & Artiba, A. (2004). Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers Industrial Engineering, 47, 431–450.CrossRefGoogle Scholar
  5. Allaoui, H., Artiba, A. (2006). Two stage hybrid flow shop scheduling with availability constraints. Computers Operations Research, 33(5), 1399–1419.CrossRefGoogle Scholar
  6. Allaoui, H., Artiba, A., Elmaghraby, S. E., & Riane, F. (2006). Scheduling two machine flow shop with an availability constraint on the first machine. Int J Product Econ, 99(1–2), 16–27.CrossRefGoogle Scholar
  7. Artiba, A., Emelyanov, V., Iaasinovski, S. (1998). Introduction to Intelligent Simulation: The RAO Language. Kluwer Academic Publishers: Dordercht.CrossRefGoogle Scholar
  8. Avramidis, A. N., & Wilson, J. R. (1996). Integrated variance reduction strategies for simulation. Operations Research, 44(2), 327–346.CrossRefGoogle Scholar
  9. Ben Daya, M. (1999). Integrated Production, Maintenance, and Quality Model for Imperfect Processes. IIE Transactions, 31, 491–501.Google Scholar
  10. Ben Daya, M., & Hariga, M. (1998). A Maintenance Inspection Model: Optimal and Heuristic Solutions. Inter J Quality Reliability Management, 5, 481–488.CrossRefGoogle Scholar
  11. Ben Daya, M., Makhdoom, M. (1998). Integrated Production and Quality Model Under Various Preventive Maintenance Policies. Journal of the Operational Research Society, 49, 840–853.Google Scholar
  12. Blazewicz, J., Finke, G., Haupt, R., & Schmidt, G. (1988). New trends in scheduling theory. European Journal of Operational Research, 37, 303–317.CrossRefGoogle Scholar
  13. Blazewicz, J., Breit, J., Formanowicz, P., Kubiak, W., & Schmidt, G. (2001) Heuristic algorithms for two-machine flowshop with limited machine availability. Omega, 29, 599–608.CrossRefGoogle Scholar
  14. Brah, S. A., Hunsucker, J. L. (1991). Branch and bound algorithm for the flow shop with multiple processors. European Journal of Operational Research, 51(1), 88–99.CrossRefGoogle Scholar
  15. Braun, O., Lai, T. C., Schmidt, G., & Sotskov, Y. N. (2002). Stability of Johnson’s schedule with respect to limited machine availability. International Journal of Production Research, 40, 4381–4400.CrossRefGoogle Scholar
  16. Chen, B., Potts, C. N., & Woeginger, G. J. (1998). A review of machine scheduling: Complexity, algorithms and approximability. Handbook of Combinatorial Optimization (Volume 3). In D.-Z. Du, & P. Pardalos (Eds), Kluwer Academic Publishers. 21–169.Google Scholar
  17. Cheng, T. C. E. & Wang, G. (2000). An improved heuristic for two-machine flowshop scheduling with an availability constraint. Operations Research Letters, 26, 223–229.CrossRefGoogle Scholar
  18. Elmaghrabi, S. E., & Soewandi, H. (2001). Sequencing jobs on two-stage hybrid flowshop with identical machines to minimize makespan. IIE Trans, 33, 985–993.Google Scholar
  19. Garey, M. R. Johnson, D. S., & Sethi, R. (1976). The complexity of flow shop and job shop scheduling. Math Oper Res, 1, 117–129.CrossRefGoogle Scholar
  20. Garey, M. R., Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman.Google Scholar
  21. Grangeon, N. Métaheuristiques et modèles d'évaluation pour le problème du flow shop hybride hi érarchisé: Contexte déterministe et contexte stochastique, Thesis at Université Blaise Pascal.Google Scholar
  22. Gupta, J. N. D., Hariri, A. M. A., & Potts, C. N. (1994). Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Annals of Operations Research, 69, 171–191.CrossRefGoogle Scholar
  23. Gupta, J. N. D. (1988). Two-stage, hybrid flowshop scheduling problem. The Journal of the Operational Research Society, 38, 359–364.Google Scholar
  24. Gupta, J. N. D., & Tunc, E. A. (1991). Schedules for a two stage hybrid flowshop with parallel machines at the second stage. International Journal of Production Research, 29, 1489–1502.CrossRefGoogle Scholar
  25. Hall, L. A. (1995). Approximability of flow shop scheduling. Proc. 36th IEEE Symp. on Foundations of Computer Science, 82–91.Google Scholar
  26. Held, M., & Karp, R. M. (1962). A dynamic programming Approach to Sequencing Problems. Journal of the SIAM, 10, 196–210.Google Scholar
  27. Hochbaum, D. S., Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems: theoretical and practical results.Journal of the ACM, 34, 144–162.CrossRefGoogle Scholar
  28. Hoogeveen, J. A., Lenstra, J. K. & Veltman, B. (1996). Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. European Journal of Operational Research, 89, 172–175.Google Scholar
  29. Jin, Z. H., Ohno, K., Ito, T., Elmaghraby, & S. E. (2002). Scheduling hybrid flowshops in printed circuit board assembly lines. POM 11, 216–230.Google Scholar
  30. Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61–68.CrossRefGoogle Scholar
  31. Karp, R. M., (1972). Reducibility among combinatorial problems. In R. E. Miller,\(\backslash\)\& J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, 85–103.Google Scholar
  32. Kubiak, W., Blazewicz, J., Formanowicz, P., Schmidt, G. (2002). Two-machine flowshop with limited machine availability. European Journal of Operational Research, 136, 528–540.CrossRefGoogle Scholar
  33. Langston, M. A. (1987). Interstage transportation planning in the deterministic flow-shop environment. Operations Research, 35(4), 556–564.CrossRefGoogle Scholar
  34. Lee, C.-Y., (1991). Parallel machine scheduling with nonsimultaneous machine availabile time. Discrete Applied Mathematics, 30, 53–61.Google Scholar
  35. Lee, C.-Y. (1996). Machine scheduling with an availability constraint. J.Global Optimization.9, 363–382Google Scholar
  36. Lee, C-Y, Cheng, T. C. E. & Lin, B. M. (1993). Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem. Management Science, 39(5), 616–625.CrossRefGoogle Scholar
  37. Lee, C.-Y. & Vairaktarakis, G. L. (1994). Minimizing makespan in hybrid flowshops. Operations Research Letters 16, 149–158.Google Scholar
  38. Lee, C.-Y., Lei, L. & Pinedo, M. (1997). Current trends in deterministic scheduling. Annals of Operations Research, 70, 1–41.CrossRefGoogle Scholar
  39. Lee, C.-Y (1997) Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Operations Research Letters, 20, 129–139.CrossRefGoogle Scholar
  40. Lee, C.-Y., & Vairaktarakis, G. (1998). Performance Comparison of Some Classes of Flexible Flowshops and Job Shops. International Journal of Flexible Manufacturing Systems, (Special Issue on Manufacturing Flexibility) 10, 379–405.CrossRefGoogle Scholar
  41. Lee, C.-Y. (1999). Two-Machine Flowshop Scheduling with Availability Constraints. European Journal of Operational Research, 114(2), 198–207.Google Scholar
  42. Linn R, & Zhang W (1999) Hybrid flow shop scheduling: a survey”. Computers & Industrial Engineering, 37, 57–61.CrossRefGoogle Scholar
  43. Mittenthall, J., & Ragavachari, M. (1993). Stochastic flowshops, Operations Research, 30, 148–162.Google Scholar
  44. Narasimhan, S. L., Panwalkar, S. S. (1984). Scheduling in a two-stage manufacturing process. International Journal of Production Research, 22, 555–564.CrossRefGoogle Scholar
  45. Narasimhan, S., & Mangiameli, P. (1987). A comparison of sequencing rules for a two-stage hybrid flow shop. Decisions Science, 18, 250–265.CrossRefGoogle Scholar
  46. Paul, R. J. (1979). A production scheduling in the glass container industry. Operations Research, 22, 290–302.CrossRefGoogle Scholar
  47. Pinedo, M. (2002). Scheduling: Theory, Algorithms and Systems (Second Edin), Prentice-Hall.Google Scholar
  48. Portman MC, Vignier A, Dardilhac D, & Dezalay D., (1998). Branch and bound crossed with GA to solve hybrid flowshops. European Journal of Operational Research, 107, 389–400.CrossRefGoogle Scholar
  49. Rajendran, C., & Chaudhuri, D. (1992). Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan. International Journal of Production Economics 27, 137–143.CrossRefGoogle Scholar
  50. Riane, F., Artiba, A., & Elmaghraby, S. E. (1998). A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan. European Journal of Operational Research 109,(2), 321–329.Google Scholar
  51. Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23,116–127.CrossRefGoogle Scholar
  52. Salvador, M. S., (1973). A solution to a special case of flow shop scheduling problems. In Symposium of the Theory of Scheduling and Applications, Elmaghraby, ed, 83–91.Google Scholar
  53. Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121, 1–15.CrossRefGoogle Scholar
  54. Schuurman, P., & Woeginger, G. J. (2000). A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, Theo Computer Science, 237, 105–122.CrossRefGoogle Scholar
  55. Sriskandarajah, C., & Sethi, S. P. (1989). Scheduling algorithms for flexible flow shops: worst and average case performance. European Journal of Operational Research, 43, 143–160.CrossRefGoogle Scholar
  56. Wittrock, R. J. (1985). Scheduling algorithms for flexible flow lines. IBM Journal Research Development, 29, 401–412.CrossRefGoogle Scholar
  57. Wittrock, R. J. (1988). An adaptable scheduling algorithm for flexible flow lines. Journal Operations Research, 36, 445–53.CrossRefGoogle Scholar
  58. Williamson, D. P., Hall, L. A., Hoogeveen. J. A., Hurkens, C. A. J., Lenstra, J. K., Sevastianov, S. V., & Shmoys, D. B. (1997). Short shop schedules. Operations Research, 45, 288–294CrossRefGoogle Scholar
  59. Zhou, J. R., Huang, J. R., & Jiang, W. S. (1996). Optimization production scheduling of multi-stage interrelated discrete system via synthetic knowledge. Proceedings of the American Control Conference, 724–728.Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Universitè de Lille Nord de France, Universit/‘e dÁrtoisArrasFrance
  2. 2.Universitè de Lille Nord de France, Universitè de ValenciennesValenciennesFrance

Personalised recommendations