Skip to main content

Advertisement

SpringerLink
Log in

Flow shop scheduling with no-wait flexible lot streaming using an adaptive genetic algorithm

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

Abstract

In this paper, we propose a flow shop scheduling problem with no-wait flexible lot streaming. The problem involves the splitting of order quantities of different products into sublots and considers alternative machines with different processing times. Sublots of a particular product are not allowed to intermingle; that is, sublots of different products must be non-preemptive. The objective of the problem is the minimization of the makespan. An adaptive genetic algorithm (GA) is proposed, which is composed of three main steps. The first step is a position-based crossover of products and local-search-based mutation for better offspring. The second step is an iterative hill-climbing algorithm to improve the current generation. The last step is the adaptive regulation of the crossover and mutation rates. Experimental results are presented for various sizes of problems to describe the performance of the proposed algorithm and they show promising outcome compared to traditional GAs.

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. Chen J, Steiner G (1998) Lot streaming with attached setups in three-machine flow shops. IIE Trans 30:1075–1084

    Google Scholar 

  2. Chen J, Steiner G (2003) On discrete lot streaming in no-wait flow shops. IIE Trans 35:91–101

    Article  MATH  Google Scholar 

  3. Hall NG, Laporte G, Selvarajah E, Sriskandarajah C (2003) Scheduling and lot streaming in flowshops with no-wait in process. J Sched 6:339–354

    Article  MATH  MathSciNet  Google Scholar 

  4. Hall NG, Laporte G, Selvarajah E, Sriskandarajah C (2005) Scheduling and lot streaming in two-machine open shops with no-wait in process. Nav Res Logist 52:261–275

    Article  MATH  MathSciNet  Google Scholar 

  5. Li C-L, Xiao W-Q (2004) Lot streaming with supplier–manufacturer coordination. Nav Res Logist 51:522–542

    Article  MATH  MathSciNet  Google Scholar 

  6. Sen A, Benli ÖS (1999) Lot streaming in open shops. Oper Res Lett 23:135–142

    Article  MathSciNet  Google Scholar 

  7. Sriskandarajah C, Wagneur E (1999) Lot streaming and scheduling multiple products in two-machine no-wait flowshops. IIE Trans 31:695–707

    Google Scholar 

  8. Kalir AA, Sarin SC (2000) Evaluation of the potential benefits of lot streaming in flow-shop systems. Int J Prod Econ 66:131–142

    Article  Google Scholar 

  9. Kalir AA, Sarin SC (2001) A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots. Omega 29:577–584

    Article  Google Scholar 

  10. Kalir AA, Sarin SC (2003) Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups. J Comb Optim 7:23–44

    Article  MATH  MathSciNet  Google Scholar 

  11. Ramasesh RV, Fu H, Fong DKH, Hayya JC (2000) Lot streaming in multistage production systems. Int J Prod Econ 66:199–211

    Article  Google Scholar 

  12. Zhang W, Yin C, Liu J, Linn RJ (2005) Multi-job lot streaming to minimize the mean completion time in m−1 hybrid flowshops. Int J Prod Econ 96:189–200

    Article  Google Scholar 

  13. Hoque MA, Goyal SK (2005) On lot streaming in multistage production systems. Int J Prod Econ 95:195–202

    Article  Google Scholar 

  14. Chiu H-N, Chang J-H, Lee C-H (2004) Lot streaming models with a limited number of capacitated transporters in multistage batch production systems. Comput Oper Res 31:2003–2020

    Article  MATH  Google Scholar 

  15. Yoon S-H, Ventura JA (2002) An application of genetic algorithms to lot-streaming flow shop scheduling. IIE Trans 34:779–787

    Google Scholar 

  16. Kumar S, Bagchi TP, Sriskandarajah C (2000) Lot streaming and scheduling heuristics for m-machine no-wait flowshops. Comput Ind Eng 38:149–172

    Article  Google Scholar 

  17. Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New York

    Google Scholar 

  18. Kim KW, Yamazaki G, Lin L, Gen M (2004) Network-based hybrid genetic algorithm for scheduling in FMS environments. Artif Life Robotics 8:67–76

    Article  Google Scholar 

  19. Mak KL, Wong YS, Wang XX (2000) An adaptive genetic algorithm for manufacturing cell formation. Int J Manuf Technol 16:491–497

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Hanyang University, 17 Haengdang-dong, Seongdong-gu, Seoul, 133-791, South Korea

    Kwanwoo Kim & In-Jae Jeong

Authors
  1. Kwanwoo Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. In-Jae Jeong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to In-Jae Jeong.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, K., Jeong, IJ. Flow shop scheduling with no-wait flexible lot streaming using an adaptive genetic algorithm. Int J Adv Manuf Technol 44, 1181–1190 (2009). https://doi.org/10.1007/s00170-007-1236-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-007-1236-0

Keywords

Search

Navigation