Journal of Global Optimization

, Volume 66, Issue 2, pp 263–290 | Cite as

Two-stage, single-lot, lot streaming problem for a \(1+2\) hybrid flow shop

  • Ming Cheng
  • Subhash C. SarinEmail author
  • Sanchit Singh


In this paper, we address a single-lot, lot streaming problem for a two-stage hybrid flow shop, which consists of one machine at Stage 1 and two parallel (identical) machines at Stage 2. The objective is to minimize makespan. The lot is to be split into sublots each of which is processed first on the machine at Stage 1, and then, on one of the machines at Stage 2. A sublot-attached removal time is incurred after processing each sublot at Stage 1. First, we assume the number of sublots for the lot to be known a priori and develop closed-form expressions to obtain optimal, continuous sublot sizes for this case. Then, we consider determination of an optimal number of sublots in addition to their sizes. We develop an upper bound on the number of sublots, \(N_{\text {pos}}\), and use an algorithm of \(O(N_{\text {pos}})\) complexity in conjunction with the closed-form expressions for sublot sizes to obtain an optimal solution. We also address the problem of determining number of sublots and integer sublot sizes, and propose a heuristic method for its solution that relies on some key results from the continuous case of the problem. The results of our numerical experimentation reveal the efficacy of the proposed method to obtain near-optimal integer sublot sizes and makespan values that are within 2.35 % of the true optimum for the testbed of data used, each obtained within a few seconds of CPU time.


Scheduling Lot streaming Hybrid flow shop 


  1. 1.
    Carpov, S., Carlier, J., Nace, D., Sirdey, R.: Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage. Comput. Oper. Res. 39(3), 736–745 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Chiang, A.C.: Fundamental Methods of Mathematical Economics, 3rd edn. McGraw-Hill, New York (1984)Google Scholar
  3. 3.
    DeVor, R., Graves, R., Mills, J.J.: Agile manufacturing research: accomplishments and opportunities. IIE Trans. 29(10), 813–823 (1997)Google Scholar
  4. 4.
    Gupta, J.N.: Two-stage, hybrid flowshop scheduling problem. J. Oper. Res. Soc. 39(4), 359–364 (1988)CrossRefzbMATHGoogle Scholar
  5. 5.
    Gupta, J.N., Tunc, E.A.: Schedules for a two-stage hybrid flowshop with parallel machines at the second stage. Int. J. Prod. Res. 29(7), 1489 (1991)CrossRefGoogle Scholar
  6. 6.
    Gupta, J.N., Tunc, E.A.: Scheduling a two-stage hybrid flowshop with separable setup and removal times. Eur. J. Oper. Res. 77(3), 415–428 (1994)CrossRefzbMATHGoogle Scholar
  7. 7.
    Hoogeveen, J.A., Lenstra, J.K., Veltman, B.: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. Eur. J. Oper. Res. 89(1), 172–175 (1996)CrossRefzbMATHGoogle Scholar
  8. 8.
    Kusiak, A.: Aggregate scheduling of a flexible machining and assembly system. IEEE Trans. Robot. Autom. 5(4), 451–459 (1989)CrossRefGoogle Scholar
  9. 9.
    Linn, R., Zhang, W.: Hybrid flow shop scheduling: A survey. Comput. Ind. Eng. 37(1–2), 57–61 (1999)CrossRefGoogle Scholar
  10. 10.
    Liu, J.: Single-job lot streaming in m+1 two-stage hybrid flowshops. Eur. J. Oper. Res. 187(3), 1171–1183 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Ruiz, R., Vazquez-Rodriguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1–18 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Sriskandarajah, C., Sethi, S.P.: Scheduling algorithms for flexible flowshops: worst and average case performance. Eur. J. Oper. Res. 43(2), 143–160 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Tsubone, H., Ohba, M., Uetake, T.: The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop. Int. J. Prod. Res. 34(11), 3037–3053 (1996)CrossRefzbMATHGoogle Scholar
  14. 14.
    Wittrock, R.J.: An adaptable scheduling algorithm for flexible flow lines. Oper. Res. 36(3), 445–453 (1988)CrossRefzbMATHGoogle Scholar
  15. 15.
    Zhang, W., Liu, J., Linn, R.J.: Model and heuristics for lot streaming of one job in m-1 hybrid flowshops. Int. J. Oper. Quant. Manag. 9, 49–64 (2003)Google Scholar
  16. 16.
    Zhang, W., Yin, C., Liu, J., Linn, R.J.: Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops. Int. J. Prod. Econ. 96(2), 189–200 (2005)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.School of Urban Rail TransportationSoochow UniversitySuzhouChina
  2. 2.Grado Department of Industrial and Systems EngineeringVirginia TechBlacksburgUSA

Personalised recommendations