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

Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

A real industrial production phenomenon, referred to as deteriorating jobs, has drawn increasing attention. However, most research on this issue considers only single-machine problems. Motivated by this limitation, this paper considers a simple linear deterioration model in a two-machine flowshop where the objective is to minimize the mean flow time. Several dominance rules and three lower bounds are proposed to speed up the search for an optimal solution, and several heuristic algorithms are provided to derive near-optimal solutions. In addition, a computational experiment is conducted to evaluate their performances. Results indicate that the algorithms perform well, and a combined heuristic algorithm is recommended for practitioners.

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14:387–393

    Article  Google Scholar 

  2. Mosheiov G (1996) ⋀-shaped policies to schedule deteriorating jobs. J Oper Res Soc 47:1184–1191

    Article  MATH  Google Scholar 

  3. Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498

    MATH  Google Scholar 

  4. Alidaee B, Womer NK (1999) Scheduling with time-dependent processing times: review and extensions. J Oper Res Soc 50:711–720

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Mosheiov G (1991) V-shaped policies for scheduling jobs. Comput Oper Res 39:979–991

    MATH  MathSciNet  Google Scholar 

  7. Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21(6):653–659

    Article  MATH  Google Scholar 

  8. Ho KIJ, Leung JYT, Wei WD (1993) Complexity of scheduling tasks with time-dependent execution times. Inf Process Lett 48:315–320

    Article  MATH  MathSciNet  Google Scholar 

  9. Gawiejnowicz S, Pankowska L (1995) Scheduling jobs with varying processing times. Inf Process Lett 54(3):175–178

    Article  MATH  Google Scholar 

  10. Cheng TCE, Ding Q (1999) The time-dependent machine makespan problem is strongly NP-complete. Comput Oper Res 26(8):749–754

    Article  MATH  MathSciNet  Google Scholar 

  11. Cheng TCE, Ding Q (2003) Scheduling start-time-dependent tasks with deadlines and identical initial processing time on a single machine. Comput Oper Res 30(1):51–62

    Article  MATH  MathSciNet  Google Scholar 

  12. Wang JB, Xia ZQ (2005) Scheduling jobs under decreasing linear deterioration. Inf Process Lett 94:63–69

    Article  MathSciNet  Google Scholar 

  13. Chen ZL (1996) Parallel machine scheduling with time-dependent processing times. Discrete Appl Math 70(1):81–93

    Article  MATH  MathSciNet  Google Scholar 

  14. Hsieh YC, Bricker DL (1997) Scheduling linearly deteriorating jobs on multiple machines. Comput Ind Eng 32:727–734

    Article  Google Scholar 

  15. Kononov A, Gawiejnowicz S (2001) NP-hard cases in scheduling deteriorating jobs on dedicated machines. J Oper Res Soc 52(6):708–717

    Article  MATH  Google Scholar 

  16. Mosheiov G (2002) Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl Math 117(1–3):195–209

    Article  MATH  MathSciNet  Google Scholar 

  17. Wang JB, Xia ZQ (2005) Flow shop scheduling problems with deteriorating jobs under dominating machines. J Oper Res Soc 56:1–7

    Article  Google Scholar 

  18. Panwalkar SS, Smith ML, Seidmann A (1982) Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30(2):391–399

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  20. Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 20/4598:671–680

    Article  MathSciNet  Google Scholar 

  21. Low CY, Yeh JY, Huang KI (2004) A robust simulated annealing heuristic for flow shop scheduling problems. Int J Adv Manuf Technol 23:762–767

    Article  Google Scholar 

  22. Lee WC, Wu CC, Chen P (2006) A simulated annealing approach to makespan minimization on identical parallel machines. Int J Adv Manuf Technol (available online)

  23. Wu CC, Lee WC, Wang WC (2006) A two-machine flowshop maximum tardiness scheduling problem with a learning effect. Int J. Adv Manuf Technol (available online)

  24. Ben-Arieh D, Maimon O (1992) Annealing method for PCB assembly scheduling on two sequential machines. Int J Comput Integr Manuf 5/6:361–367

    Article  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the editor and the anonymous referees whose constructive comments have led to a substantial improvement in the presentation of the paper. This work is supported by the National Science Council of Taiwan, Republic of China, under grant number NSC 94-2213-E-035-020.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Feng Chia University, 100 Wenhwa Road, Taichung, Republic of China

    Yau-Ren Shiau

  2. Department of Statistics, Feng Chia University, 100 Wenhwa Road, Taichung, Republic of China

    Wen-Chiung Lee, Chin-Chia Wu & Chia-Ming Chang

Authors
  1. Yau-Ren Shiau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wen-Chiung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chin-Chia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chia-Ming Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wen-Chiung Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shiau, YR., Lee, WC., Wu, CC. et al. Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration. Int J Adv Manuf Technol 34, 774–782 (2007). https://doi.org/10.1007/s00170-006-0646-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0646-8

Keywords

Search

Navigation