Skip to main content
SpringerLink
Log in

Hybrid Flow Shop Scheduling with Availability Constraints

  • Chapter
  • First Online:
Book cover Essays in Production, Project Planning and Scheduling

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 200))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Thus \(C_{2}\left(N_{k}\left(B\right) \right) =C_{2,l}\left(N_{k}\left(B\right) \right)\) where l is the last job in the set B.

References

  • 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.

    Article  Google Scholar 

  • Allahverdi, A. (1996). Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computer Operations Research, (23-10) 909–916.

    Google Scholar 

  • 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 

  • Allaoui, H., & Artiba, A. (2004). Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers Industrial Engineering, 47, 431–450.

    Article  Google Scholar 

  • Allaoui, H., Artiba, A. (2006). Two stage hybrid flow shop scheduling with availability constraints. Computers Operations Research, 33(5), 1399–1419.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Artiba, A., Emelyanov, V., Iaasinovski, S. (1998). Introduction to Intelligent Simulation: The RAO Language. Kluwer Academic Publishers: Dordercht.

    Book  Google Scholar 

  • Avramidis, A. N., & Wilson, J. R. (1996). Integrated variance reduction strategies for simulation. Operations Research, 44(2), 327–346.

    Article  Google Scholar 

  • Ben Daya, M. (1999). Integrated Production, Maintenance, and Quality Model for Imperfect Processes. IIE Transactions, 31, 491–501.

    Google Scholar 

  • Ben Daya, M., & Hariga, M. (1998). A Maintenance Inspection Model: Optimal and Heuristic Solutions. Inter J Quality Reliability Management, 5, 481–488.

    Article  Google Scholar 

  • 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 

  • Blazewicz, J., Finke, G., Haupt, R., & Schmidt, G. (1988). New trends in scheduling theory. European Journal of Operational Research, 37, 303–317.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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 

  • 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.

    Article  Google Scholar 

  • 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 

  • Garey, M. R. Johnson, D. S., & Sethi, R. (1976). The complexity of flow shop and job shop scheduling. Math Oper Res, 1, 117–129.

    Article  Google Scholar 

  • Garey, M. R., Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman.

    Google Scholar 

  • 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 

  • 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.

    Article  Google Scholar 

  • Gupta, J. N. D. (1988). Two-stage, hybrid flowshop scheduling problem. The Journal of the Operational Research Society, 38, 359–364.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Hall, L. A. (1995). Approximability of flow shop scheduling. Proc. 36th IEEE Symp. on Foundations of Computer Science, 82–91.

    Google Scholar 

  • Held, M., & Karp, R. M. (1962). A dynamic programming Approach to Sequencing Problems. Journal of the SIAM, 10, 196–210.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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 

  • 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 

  • Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61–68.

    Article  Google Scholar 

  • 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 

  • Kubiak, W., Blazewicz, J., Formanowicz, P., Schmidt, G. (2002). Two-machine flowshop with limited machine availability. European Journal of Operational Research, 136, 528–540.

    Article  Google Scholar 

  • Langston, M. A. (1987). Interstage transportation planning in the deterministic flow-shop environment. Operations Research, 35(4), 556–564.

    Article  Google Scholar 

  • Lee, C.-Y., (1991). Parallel machine scheduling with nonsimultaneous machine availabile time. Discrete Applied Mathematics, 30, 53–61.

    Google Scholar 

  • Lee, C.-Y. (1996). Machine scheduling with an availability constraint. J.Global Optimization.9, 363–382

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Lee, C.-Y. & Vairaktarakis, G. L. (1994). Minimizing makespan in hybrid flowshops. Operations Research Letters 16, 149–158.

    Google Scholar 

  • Lee, C.-Y., Lei, L. & Pinedo, M. (1997). Current trends in deterministic scheduling. Annals of Operations Research, 70, 1–41.

    Article  Google Scholar 

  • Lee, C.-Y (1997) Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Operations Research Letters, 20, 129–139.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Lee, C.-Y. (1999). Two-Machine Flowshop Scheduling with Availability Constraints. European Journal of Operational Research, 114(2), 198–207.

    Google Scholar 

  • Linn R, & Zhang W (1999) Hybrid flow shop scheduling: a survey”. Computers & Industrial Engineering, 37, 57–61.

    Article  Google Scholar 

  • Mittenthall, J., & Ragavachari, M. (1993). Stochastic flowshops, Operations Research, 30, 148–162.

    Google Scholar 

  • Narasimhan, S. L., Panwalkar, S. S. (1984). Scheduling in a two-stage manufacturing process. International Journal of Production Research, 22, 555–564.

    Article  Google Scholar 

  • Narasimhan, S., & Mangiameli, P. (1987). A comparison of sequencing rules for a two-stage hybrid flow shop. Decisions Science, 18, 250–265.

    Article  Google Scholar 

  • Paul, R. J. (1979). A production scheduling in the glass container industry. Operations Research, 22, 290–302.

    Article  Google Scholar 

  • Pinedo, M. (2002). Scheduling: Theory, Algorithms and Systems (Second Edin), Prentice-Hall.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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 

  • Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23,116–127.

    Article  Google Scholar 

  • 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 

  • Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121, 1–15.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Wittrock, R. J. (1985). Scheduling algorithms for flexible flow lines. IBM Journal Research Development, 29, 401–412.

    Article  Google Scholar 

  • Wittrock, R. J. (1988). An adaptable scheduling algorithm for flexible flow lines. Journal Operations Research, 36, 445–53.

    Article  Google Scholar 

  • 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–294

    Article  Google Scholar 

  • 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 

Download references

Author information

Authors and Affiliations

  1. Universitè de Lille Nord de France, Universit/‘e dÁrtois, Arras, France

    Hamid Allaoui

  2. Universitè de Lille Nord de France, Universitè de Valenciennes, Valenciennes, France

    Abdelhakim Artiba

Authors
  1. Hamid Allaoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdelhakim Artiba
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hamid Allaoui .

Editor information

Editors and Affiliations

  1. College of Engineering, The University of Oklahoma, Norman, Oklahoma, USA

    P. Simin Pulat

  2. Dept of Industrial & Systems Engineering, Virginia Tech, Blacksburg, Virginia, USA

    Subhash C. Sarin

  3. Dept of Industrial & Systems Engineering, North Carolina State University, Raleigh, North Carolina, USA

    Reha Uzsoy

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Allaoui, H., Artiba, A. (2014). Hybrid Flow Shop Scheduling with Availability Constraints. In: Pulat, P., Sarin, S., Uzsoy, R. (eds) Essays in Production, Project Planning and Scheduling. International Series in Operations Research & Management Science, vol 200. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-9056-2_12

Download citation

Publish with us

Policies and ethics

Search

Navigation