Skip to main content
SpringerLink
Log in

Minimizing makespan in a two-machine flow shop with effects of deterioration and learning

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We consider a two-machine flow shop scheduling problem with effects of deterioration and learning. By the effects of deterioration and learning, we mean that the processing time of a job is a function of its execution starting time and its position in a sequence. The objective is to find a sequence that minimizes the makespan. Several dominance properties and two lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm proposed to solve the problem. Two heuristic algorithms are also proposed to obtain near-optimal solutions. Computational results are presented to evaluate the performance of the proposed algorithms.

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

Access this article

Log in via an institution

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. Alidaee B., Womer N.K.: Scheduling with time dependent processing processing times: review and extensions. J. Oper. Res. Soc. 50, 711–720 (1999)

    MATH  Google Scholar 

  2. Biskup D.: Single-machine scheduling with learning considerations. Eur. J. Oper. Res. 115, 173–178 (1999)

    Article  MATH  Google Scholar 

  3. Biskup D.: A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 188, 315–329 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cheng T.C.E., Ding Q., Lin BMT.: A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152, 1–13 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cheng T.C.E., Wu C.-C., Lee W.C.: Some scheduling problems with sum-of-processing -times-based and job-position-based learning effects. Inf. Sci. 178, 2476–2487 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cheng T.C.E., Wu C.-C., Lee W.C.: Some scheduling problems with deteriorating jobs and learning effects. Comput. Ind. Eng. 54, 972–982 (2008)

    Article  Google Scholar 

  7. Floudas, C.A., Pardalos, P.M.: Encyclopedia of Optimization. 2nd ed. Springer (2009)

  8. Gawiejnowicz, S.: Time-dependent scheduling. Springer (2008)

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

  10. Lee W.-C.: A note on deteriorating jobs and learning in single-machine scheduling problems. Int. J. Bus. Econ. 3, 83–89 (2004)

    Google Scholar 

  11. Lee W.-C., Wu C.-C.: Minimizing total completion time in a two-machine flowshop with a learning effect. Int. J. Prod. Econ. 88, 85–93 (2004)

    Article  Google Scholar 

  12. Lee W-C., Wu C-C.: A two-machine flowshop makespan scheduling problem with deteriorating jobs. Comput. Ind. Eng. 54, 737–749 (2008)

    Article  Google Scholar 

  13. Lee W-C., Wu C-C., Hsu P-H.: A single-machine learning effect scheduling problem with release times. Omega Int. J. Manag. Sci. 38, 3–11 (2010)

    Article  Google Scholar 

  14. Lee C.-Y., Yu G.: Parallel-machine scheduling under potential disruption. Optim. Lett. 2, 27–37 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mosheiov G.: Complexity analysis of job-shop scheduling with deteriorating jobs. Discret. Appl. Math. 117, 195–209 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Nembhard DA., Osothsilp N.: Task complexity effects on between-individual learning/forgetting variability. Int. J. Ind. Ergonomics 29, 297–306 (2002)

    Article  Google Scholar 

  17. Ng C.T., Wang J.-B., Cheng T.C.E., Liu L.-L.: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Comput. Oper. Res. 37, 83–90 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  18. Pardalos P.M., Resende M.G.C.: Handbook of Applied Optimization. Oxford Univ Press, USA (2002)

    MATH  Google Scholar 

  19. Pardalos P.M.: Complexity in Numerical Optimization. World Scientific, USA (1993)

    Book  MATH  Google Scholar 

  20. Setamaa-Karkkainen A., Miettinen K., Vuori J.: Heuristic for a new multiobjective scheduling problem. Optim. Lett. 1, 213–225 (2007)

    Article  MathSciNet  Google Scholar 

  21. Shiau Y.-R., Lee W.-C., Wu C.-C., Chang C.-M.: Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration. Int. J. Adv. Manuf. Technol. 34, 774–782 (2007)

    Article  Google Scholar 

  22. Toksar M.D., Guner E.: Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int. J. Adv. Manuf. Technol. 38, 801–808 (2008)

    Article  Google Scholar 

  23. Wang C., Chu C., Proth J.M.: Efficient heuristic and optimal approaches for \({n/2/F/\sum C_i}\) scheduling problems. Int. J. Prod. Econ. 44, 225–237 (1996)

    Article  Google Scholar 

  24. Wang J.-B., Liu L.-L.: Two-machine flow shop problem with effects of deterioration and learning. Comput. Ind. Eng. 57, 1114–1121 (2009)

    Article  Google Scholar 

  25. Wang, J.-B., Wang, M.-Z.: Single-machine scheduling with nonlinear deterioration. Optim. Lett. doi:10.1007/s11590-010-0253-3

  26. Wang, X.-Y., Wang, D., Yin, N.: A note on single-machine scheduling with nonlinear deterioration. Optim. Lett. doi:10.1007/s11590-011-0295-1

  27. Wu C.-C., Lee W.C.: Single-machine scheduling problems with a learning effect. Appl. Math. Model. 32, 1191–1197 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  28. Wu C.C., Lee W.C.: Single-machine group scheduling problems with deteriorating setup times and job processing times. Int. J. Prod. Econ. 115, 128–133 (2008)

    Article  Google Scholar 

  29. Wu C.-C., Lee W.-C., Shiau Y.-R.: Minimizing the total weighted completion time on a single machine under linear deterioration. Int. J. Adv. Manuf. Technol. 33, 1237–1243 (2007)

    Article  Google Scholar 

  30. Zhao C.-L., Tang H.-Y.: A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints.. Optim. Lett. 5, 183–190 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Shenyang Aerospace University, Shenyang, 110136, China

    Ji-Bo Wang & Dan Wang

  2. Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

    P. Ji

  3. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

    T. C. E. Cheng

Authors
  1. Ji-Bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. C. E. Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ji-Bo Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, JB., Ji, P., Cheng, T.C.E. et al. Minimizing makespan in a two-machine flow shop with effects of deterioration and learning. Optim Lett 6, 1393–1409 (2012). https://doi.org/10.1007/s11590-011-0334-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0334-y

Keywords

Search

Navigation