Skip to main content
SpringerLink
Log in

Multi-job lot streaming to minimize the weighted completion time in a hybrid flow shop scheduling problem with work shift constraint

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

Abstract

Lot streaming means breaking a lot into sublots, where sublots may be transferred to a number of machines for the operations. Here, the multi-job lot streaming problem in a multistage hybrid flow shop having identical parallel machines at stages with work-in-process (WIP) jobs, work shifts constraint, and sequence-dependent setup times is studied. The aim is to minimize the sum of weighted completion times of jobs in each shift in order to furnish a better machine utilization for the following shifts. Our model in meeting the job demands appropriates job scheduling on machines for processing, the sequence of operations on allocated machines, the size of the sublots in the work shifts, the work completion times in all the shifts, and the jobs in each stage as the WIP jobs. To solve the problem, a genetic algorithm (GA) and simulated annealing (SA) are proposed to compute the best scheduling for the hybrid flow shop problem. Numerical illustrations demonstrate the applicability of the proposed model and the effectiveness of the GA.

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. Truscott W (1986) Production scheduling with capacity constrained transportation activities. J Oper Manage 6:333–348

    Article  Google Scholar 

  2. Potts CN, Wassenhove LN (1992) Integrating scheduling with batching and lot sizing: a review of algorithm and complexity. J Oper Res Soc 43(5):395–406

    MATH  Google Scholar 

  3. Goldratt E, Goldratt EM (1984) The race. North River Press, New York

    Google Scholar 

  4. Baker KR (1978) Lot streaming to reduce cycle time in a flow shop, Working Paper #203, Amostuck School, Dartmoot College

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

    Article  Google Scholar 

  6. Kumar S, Bagchi TP, Srisk, Srisk AC (2000) Lot streaming and scheduling heuristics for m-machine no-wait flow shops. Comput Ind Eng 38:149–172

    Article  Google Scholar 

  7. Buscher U, Shen L (2009) An integrated tabu search algorithm for the lot streaming problem in job shops. Eur J Oper Res 199(2):385–399

    Article  MATH  Google Scholar 

  8. Taofeng Y (2012) Analysis on multi-stage lot streaming: the effect of transfer. Comput Ind Eng 62(4):1046–1054

    Article  Google Scholar 

  9. Pan Q-K, Suganthan PN, Liang JJ, Fatih Tasgetiren M (2011) A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Syst Appl 38(4):3252–3259

    Article  Google Scholar 

  10. Pan Q-K, Ruiz R (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40(2):166–180

    Article  Google Scholar 

  11. Defersha FM (2011) A comprehensive mathematical model for hybrid flexible flow shop lot streaming problem. Int J Ind Eng Comput 2:283–294

    Google Scholar 

  12. Feldmann M, Biskup D (2008) Lot streaming in a multiple product permutation flow shop with intermingling. Int J Prod Res 46(1):197–216

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  14. Feldman M, Biskup D (2008) Lot streaming in a multiple product permutation flow shop with intermingling. Int J Prod Res 46(1):197–216

    Article  Google Scholar 

  15. Chang JH, Chiu HN (2005) Comprehensive review of lot streaming. Int J Prod Res 43(8):1515–1536

    Article  Google Scholar 

  16. Szendrovits AZ (1975) Manufacturing cycle time determination for a multi-stage economic production quantity model. Manag Sci 22:298–308

    Article  MATH  Google Scholar 

  17. Goyal SK (1976) Notes on manufacturing cycle time determination for a multi-stage economic production quantity model. Manag Sci 23:332–333

    Article  MATH  Google Scholar 

  18. Szendrovits AZ (1976) On the optimality of sub-batch for a multi-stage EPQ model—a rejoinder. Manag Sci 23:334–338

    Article  MATH  Google Scholar 

  19. Potts CN, Baker KR (1989) Flow shop scheduling with lot streaming. Oper Res Lett 8:297–303

    Article  MATH  MathSciNet  Google Scholar 

  20. Kropp DH, Smunt TL (1990) Optimal and heuristic models for lot splitting in a flow shop. Decis Sci 21:691–709

    Article  Google Scholar 

  21. Steiner G, Truscott WG (1993) Batch scheduling to minimize cycle time, flow time, and processing cost. IIE Trans 25:90–97

    Article  Google Scholar 

  22. Trietsch D, Baker KR (1993) Basic techniques for lot streaming. Oper Res 41:1065–1076

    Article  MATH  Google Scholar 

  23. Kim JS, Kang SH, Lee SM (1997) Transfer batch scheduling for a two-stage flow shop with identical parallel machines at each stage. Int J Manag Sci 25(5):547–555

    Google Scholar 

  24. Alper S, Topaloglu E, Benli SO (1998) Optimal streaming of a single job in a two-stage flow shop. Eur J Oper Res 110:42–62

    Article  MATH  Google Scholar 

  25. Alper S, Benli S (1999) Lot streaming in open shops. Oper Res Lett 23:135–142

    Google Scholar 

  26. Ramasesh VR, Haizhen F, Duncan KHF, Jack CH (2000) Lot streaming in multistage production systems. Intern J Prod Econ 66:199–211

    Article  Google Scholar 

  27. Bogaschewsky RW, Buscher UD, Lindner G (2001) Optimizing multi-stage production with constant lot size and varying number of unequal sized batches. Omega 29:183–191

    Article  Google Scholar 

  28. Yoon S, Ventura A (2002) Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling. Comput Oper Res 29:1301–1315

    Article  MATH  MathSciNet  Google Scholar 

  29. Aksen D, Altinkemer K, Chand S (2003) The single-item lot sizing problem with immediate lost sales. Eur J Oper Res 147:558–566

    Article  MATH  MathSciNet  Google Scholar 

  30. Van Nieuwenhuyse I, Vandaele N (2004) Determining the optimal number of sub lots in a single-product deterministic flow shop with overlapping operations. Int J Prod Econ 92:221–239

    Article  Google Scholar 

  31. Riezebos J (2004) Time bucket length and lot splitting approach. Int J Prod Res 42:2325–2338

    Article  MATH  Google Scholar 

  32. Chiu HN, Chang JH, Lee CH (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 

  33. Kenyon G, Canel C, Neureuther BD (2005) The impact of lot-sizing on net profits and cycle times in the n-job, m-machine job shop with both discrete and batch processing. Int J Prod Econ 97:263–278

    Article  Google Scholar 

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

    Article  Google Scholar 

  35. Ren J, Zhang Y, Guo S (2008) Approximation algorithm of minimizing make span in parallel bounded batch scheduling, ORSC & APORC: 53–59

  36. Sarin SC, Kalir AA, Chen M (2008) A single-lot, unified cost-based flow shop lot-streaming problem. Int J Prod Econ 113:413–424

    Article  Google Scholar 

  37. Tseng CT, Liao CJ (2008) A discrete particle swarm optimization for lot-streaming flow shop scheduling problem. Eur J Oper Res 191:360–373

    Article  MATH  Google Scholar 

  38. Liu J (2008) Single-job lot streaming in m-1 two-stage hybrid flow shops. Eur J Oper Res 187:1171–1183

    Article  MATH  Google Scholar 

  39. Marimuthu S, Ponnambalam SG, Jawahar N (2008) Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robot Comput-Integrated Manuf 24:125–139

    Article  Google Scholar 

  40. Marimuthu S, Ponnambalam SG, Jawahar N (2009) Threshold accepting and ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming. J Mater Process Technol 209:1026–1041

    Article  Google Scholar 

  41. Wong WK, Chan CK, Ip WH (2001) A hybrid flow shop scheduling model for apparel manufacture. Intern J Clothing Sci Tech 13(2):115–129

    Article  Google Scholar 

  42. Yimer AD, Demirli K (2009) Fuzzy scheduling of job orders in a two-stage flow shop with batch processing machines. Int J Approx Reason 50:117–137

    Article  MATH  MathSciNet  Google Scholar 

  43. Chen SH, Cang PC, Liu CH (2007) Sub-population genetic algorithm with mining gene structures for multi objective flow shop scheduling problems. Expert Syst Appl 33:762–771

    Article  Google Scholar 

  44. Peng J, Liu B (2004) Parallel machine scheduling models with fuzzy processing times. Inform Sci 166:49–66

    Article  MATH  MathSciNet  Google Scholar 

  45. Tavakkoli-Moghaddam R, Rahimi-Vahed AR, Ghodratnama A, Siadat A (2009) A simulated annealing method for solving a new mathematical model of a multi-criteria cell formation problem with capital constraints. Adv Eng Softw 40(4):268–273

    Article  MATH  Google Scholar 

  46. Carter, Ashley H (2001) Classical and statistical thermodynamics. Prentice-Hall, Inc, New Jersey

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran

    Mohsen Nejati, Iraj Mahdavi, Reza Hassanzadeh & MohamadSailm Mojarad

  2. Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran

    Nezam Mahdavi-Amiri

Authors
  1. Mohsen Nejati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Iraj Mahdavi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Reza Hassanzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nezam Mahdavi-Amiri
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. MohamadSailm Mojarad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Iraj Mahdavi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nejati, M., Mahdavi, I., Hassanzadeh, R. et al. Multi-job lot streaming to minimize the weighted completion time in a hybrid flow shop scheduling problem with work shift constraint. Int J Adv Manuf Technol 70, 501–514 (2014). https://doi.org/10.1007/s00170-013-5265-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-013-5265-6

Keywords

Search

Navigation