Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

The Two-stage Assembly Flow Shop Scheduling with an Availability Constraint: Worst Case Analysis

  • Published:
Journal of Mathematical Modelling and Algorithms in Operations Research

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In this paper, we are interested in handling the limited availability of machines in the two-stage assembly flow shop scheduling problems. Emphasis is put on the semiresumable case with respect to the minimization of the makespan. We provide, when possible, heuristics with a tight worst-case ratio bound of 2.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Breit, J.: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. Inf. Process. Lett. 90, 273–278 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cheng, T.C.E, Wang, G.: An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper. Res. Lett. 26, 223–229 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hadda, H., Dridi, N., Hajri-Gabouj, S.: The two-stage assembly flow shop scheduling with an availability constraint. In: Proc. 3rd Multidisciplinary International Conference on Scheduling: Theory and Application, pp. 184–191. Paris, France (2007)

  4. Hadda, H., Dridi, N., Hajri-Gabouj, S.: An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs. 4OR-Q. J. Oper. Res. 8, 87–99 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hadda, H.: A (\(\frac 4 3 \))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints. Optim. Lett. 3, 583–592 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hadda, H.: An improved algorithm for the two machine flow shop problem with several availability constraints. 4OR-Q. J. Oper. Res. 8, 271–280 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hadda, H.: A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints. Optim. Lett. 6, 559–569 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Haouari, M., Daouas, T.: Optimal scheduling of the 3-machine assembly-type flow shop. RAIRO Oper. Res. 33, 439–445 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hariri, A.M.A., Potts, C.N.: A branch and bound algorithm for the two-stage assembly scheduling problem. Eur. J. Oper. Res. 103, 547–556 (1997)

    Article  MATH  Google Scholar 

  10. Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Quart. 1, 61–68 (1954)

    Article  Google Scholar 

  11. Kubiak, W., Blazewicz, J., Formanowicz, P., Breit, J., Schmidt, G.: Two-machine flow shops with limited machine availability. Eur. J. Oper. Res. 136, 528–540 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kubzin, M.A., Potts, C.N., Strusevich, V.A.: Approximation results for flow shop scheduling problems with machine availability constraints. Comput. Oper. Res. 36, 379–390 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lee, C.Y.: Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Oper. Res. Lett. 20, 129–139 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lee, C.Y., Two-machine flowshop scheduling with availability constraints. Eur. J. Oper. Res. 114, 420–429 (1999)

    Article  MATH  Google Scholar 

  15. Lee, C.Y., Cheng, T.C.E., Lin, B.M.T.: Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Manag. Sci. 39, 616–625 (1993)

    Article  MATH  Google Scholar 

  16. Ng, C.T., Kovalyov, M.Y.: An FPTAS for shceduling a two-machine flowshop with one availability interval. Nav. Res. Logist. 51, 307–315 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  17. Potts, C.N., Sevast’janov, S.V., Strusevich, V.A., Van wassenhove, L.N., Zwaneveld, C.M.: The two-stage assembly scheduling problem: complexity and approximation. Oper. Res. 43, 346–355 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Ying, M., Chengbin, C., Chunrong, Z.: A survey of scheduling with deterministic machine availability constraints. Comput. Ind. Eng. 58, 199–211 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LISI, INSAT-Tunis, Centre Urbain Nord B.P. N676, 1080, Tunis Cedex, Tunisia

    Hatem Hadda & Sonia Hajri-Gabouj

  2. OASIS, ENIT, BP. 37, Le belvédère 1002, Tunis, Tunisia

    Najoua Dridi

Authors
  1. Hatem Hadda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Najoua Dridi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sonia Hajri-Gabouj
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hatem Hadda.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hadda, H., Dridi, N. & Hajri-Gabouj, S. The Two-stage Assembly Flow Shop Scheduling with an Availability Constraint: Worst Case Analysis. J Math Model Algor 13, 233–245 (2014). https://doi.org/10.1007/s10852-013-9235-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-013-9235-7

Keywords