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

  • Yau-Ren Shiau
  • Wen-Chiung Lee
  • Chin-Chia Wu
  • Chia-Ming Chang
ORIGINAL ARTICLE

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.

Keywords

Production Mean flow time Linear deterioration 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14:387–393CrossRefGoogle Scholar
  2. 2.
    Mosheiov G (1996) ⋀-shaped policies to schedule deteriorating jobs. J Oper Res Soc 47:1184–1191MATHCrossRefGoogle Scholar
  3. 3.
    Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498MATHGoogle Scholar
  4. 4.
    Alidaee B, Womer NK (1999) Scheduling with time-dependent processing times: review and extensions. J Oper Res Soc 50:711–720MATHCrossRefGoogle Scholar
  5. 5.
    Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Mosheiov G (1991) V-shaped policies for scheduling jobs. Comput Oper Res 39:979–991MATHMathSciNetGoogle Scholar
  7. 7.
    Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21(6):653–659MATHCrossRefGoogle Scholar
  8. 8.
    Ho KIJ, Leung JYT, Wei WD (1993) Complexity of scheduling tasks with time-dependent execution times. Inf Process Lett 48:315–320MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Gawiejnowicz S, Pankowska L (1995) Scheduling jobs with varying processing times. Inf Process Lett 54(3):175–178MATHCrossRefGoogle Scholar
  10. 10.
    Cheng TCE, Ding Q (1999) The time-dependent machine makespan problem is strongly NP-complete. Comput Oper Res 26(8):749–754MATHCrossRefMathSciNetGoogle Scholar
  11. 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–62MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Wang JB, Xia ZQ (2005) Scheduling jobs under decreasing linear deterioration. Inf Process Lett 94:63–69CrossRefMathSciNetGoogle Scholar
  13. 13.
    Chen ZL (1996) Parallel machine scheduling with time-dependent processing times. Discrete Appl Math 70(1):81–93MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Hsieh YC, Bricker DL (1997) Scheduling linearly deteriorating jobs on multiple machines. Comput Ind Eng 32:727–734CrossRefGoogle Scholar
  15. 15.
    Kononov A, Gawiejnowicz S (2001) NP-hard cases in scheduling deteriorating jobs on dedicated machines. J Oper Res Soc 52(6):708–717MATHCrossRefGoogle Scholar
  16. 16.
    Mosheiov G (2002) Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl Math 117(1–3):195–209MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Wang JB, Xia ZQ (2005) Flow shop scheduling problems with deteriorating jobs under dominating machines. J Oper Res Soc 56:1–7CrossRefGoogle Scholar
  18. 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–399MATHCrossRefGoogle Scholar
  19. 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–237CrossRefGoogle Scholar
  20. 20.
    Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 20/4598:671–680CrossRefMathSciNetGoogle Scholar
  21. 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–767CrossRefGoogle Scholar
  22. 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)Google Scholar
  23. 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)Google Scholar
  24. 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–367CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2006

Authors and Affiliations

  • Yau-Ren Shiau
    • 1
  • Wen-Chiung Lee
    • 2
  • Chin-Chia Wu
    • 2
  • Chia-Ming Chang
    • 2
  1. 1.Department of Industrial EngineeringFeng Chia UniversityTaichungRepublic of China
  2. 2.Department of StatisticsFeng Chia UniversityTaichungRepublic of China

Personalised recommendations