Skip to main content
SpringerLink
Log in

Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper focuses on the scheduling problem of minimizing makespan for a given set of jobs in a two-stage hybrid flowshop subject to a product-mix ratio constraint. There are identical parallel machines at the first stage of the hybrid flowshop, while there is a single batch-processing machine at the second stage. Ready times of the jobs (at the first stage) may be different, and a given product-mix ratio of job types should be kept in each batch at the second stage. We present three types of heuristic algorithms: forward scheduling algorithms, backward scheduling algorithms, and iterative algorithms. To evaluate performance of the suggested algorithms, a series of computational experiments are performed on randomly generated test problems and results are reported.

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

  • Arthanary, T.S., Ramaswamy, K.G.: An extension of two machine sequencing problem. Opsearch 8(4), 10–22 (1971)

    MathSciNet  Google Scholar 

  • Brah, S.A., Hunsucker, J.L.: Branch and bound algorithm for the flow shop with multiple processors. Eur. J. Oper. Res. 51(1), 88–99 (1991)

    Article  MATH  Google Scholar 

  • Chen, B.: Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage. J. Oper. Res. Soc. 46(2), 234–244 (1995)

    Article  MATH  Google Scholar 

  • Cheng, T.C.E.: A heuristic for common due-date assignment and job scheduling on parallel machines. J. Oper. Res. Soc. 40(12), 1129–1135 (1989)

    Article  MATH  Google Scholar 

  • Cheng, T.C.E., Kovalyov, M.Y., Chakhlevich, K.N.: Batching in a two-stage flowshop with dedicated machines in the second stage. IIE Trans. 36(1), 87–93 (2004)

    Article  Google Scholar 

  • Choi, S.-W., Kim, Y.-D., Lee, G.-C.: Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. Int. J. Prod. Res. 43(11), 2149–2167 (2005)

    Article  MATH  Google Scholar 

  • Coffman Jr., E.G., Garey, M.R.: Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. 7(1), 1–17 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  • Dell’amico, M., Iori, M., Martello, S.: Heuristic algorithms and scatter search for the cardinality constrained P||Cmax problem. J. Heuristics 10(2), 169–204 (2004)

    Article  Google Scholar 

  • Franca, P.M., Gendreau, M., Laporte, G., Muller, F.M.: A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Comput. Oper. Res. 21(2), 205–210 (1994)

    Article  MATH  Google Scholar 

  • Friesen, D.K.: Tighter bounds for the MULTIFIT processor scheduling algorithm. SIAM J. Comput. 13(1), 170–181 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Strong NP-completeness results: motivation, examples and implications. J. Assoc. Comput. Mach. 25, 499–508 (1978)

    MATH  MathSciNet  Google Scholar 

  • Guinet, A.G.P., Solomon, M.M.: Scheduling hybrid flowshops to minimize maximum tardiness and maximum completion time. Int. J. Prod. Res. 34(6), 1643–1654 (1996)

    Article  MATH  Google Scholar 

  • Gupta, J.N.D.: Two-stage, hybrid flowshop scheduling problem. J. Oper. Res. Soc. 39(4), 359–364 (1988)

    Article  MATH  Google Scholar 

  • Gupta, J.N.D., Tunc, E.A.: Schedules for a two stage hybrid flowshop with parallel machines at the second stage. Int. J. Prod. Res. 29(7), 1489–1502 (1991)

    Article  Google Scholar 

  • Gupta, J.N.D., Tunc, E.A.: Scheduling a two stage hybrid flowshop with separable setup and removal times. Eur. J. Oper. Res. 77(3), 415–428 (1994)

    Article  MATH  Google Scholar 

  • Gupta, J.N.D., Hariri, A.M.A., Potts, C.N.: Scheduling a two stage hybrid flowshop with parallel machines at the first stage. Ann. Oper. Res. 69, 171–191 (1997)

    Article  MATH  Google Scholar 

  • 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)

    Article  MATH  Google Scholar 

  • Ikura, Y., Gimple, M.: Efficient scheduling algorithm for a single batch processing machine. Oper. Res. Lett. 5(2), 61–65 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  • Janiak, A., Kozan, E., Lichtenstein, M., Oguz, C.: Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. Int. J. Prod. Econ. 105(2), 407–424 (2007)

    Article  Google Scholar 

  • Jin, Z., Yang, Z., Ito, T.: Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem. Int. J. Prod. Econ. 100(2), 322–334 (2006)

    Article  Google Scholar 

  • Joo, B.-J., Kim, Y.-D.: An optimal solution algorithm for a batch-processing machine scheduling problem with a product-mix ratio constraint. Int. J. Ind. Eng. 14(2), 198–202 (2007)

    Google Scholar 

  • Kim, Y.-D.: On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems. Int. J. Prod. Res. 25(12), 1751–1759 (1987)

    Google Scholar 

  • Kim, Y.-D.: A backward approach in list scheduling algorithms for multi-machine tardiness problems. Comput. Oper. Res. 22(3), 307–319 (1995)

    Article  MATH  Google Scholar 

  • Kis, T., Pesch, E.: A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur. J. Oper. Res. 164(3), 592–608 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Kochhar, S., Morris, R.J.T.: Heuristic methods for flexible flow line scheduling. J. Manuf. Syst. 6(4), 299–314 (1987)

    Article  Google Scholar 

  • Koulamas, C.P.: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem. Nav. Res. Logist. 44(1), 109–125 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  • Lee, C.-Y., Vairaktarakis, G.L.: Minimizing makespan in hybrid flowshops. Oper. Res. Lett. 16(3), 149–158 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  • Lee, C.-Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40(4), 764–775 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  • Lee, G.-C.: Scheduling methods for a hybrid flowshop with dynamic order arrival. J. Korean Inst. Ind. Eng. 32(4), 373–381 (2006)

    Google Scholar 

  • Lee, G.-C., Kim, Y.-D.: A Branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness. Int. J. Prod. Res. 42(22), 4731–4743 (2004)

    Article  MATH  Google Scholar 

  • Lee, G.-C., Kim, Y.-D., Choi, S.-W.: Bottleneck-focused scheduling for a hybrid flowshop. Int. J. Prod. Res. 42(1), 165–181 (2004)

    Article  MATH  Google Scholar 

  • Lee, J.-S., Park, S.-H.: Scheduling heuristics for a two-stage hybrid flowshop with non-identical parallel machines. J. Korean Inst. Ind. Eng. 25(2), 254–265 (1999)

    Google Scholar 

  • Li, C.-L., Lee, C.-Y.: Scheduling with agreeable release times and due dates on a batch-processing machine. Eur. J. Oper. Res. 96(3), 564–569 (1997)

    Article  MATH  Google Scholar 

  • Linn, R., Zhang, W.: Hybrid flowshop scheduling: a survey. Comput. Ind. Eng. 37(1–2), 57–61 (1999)

    Article  Google Scholar 

  • Mittal, B.S., Nagga, P.C.: Two machine sequencing problem with parallel machines. Opsearch 10, 10–22 (1973)

    Google Scholar 

  • Narasimhan, S.L., Panwalkar, S.S.: Scheduling in a two-stage manufacturing process. Int. J. Prod. Res. 22(4), 555–564 (1984)

    Article  Google Scholar 

  • Neale, J.J., Duenyas, I.: Control of manufacturing networks which contain a batch processing machine. IIE Trans. 32(11), 1027–1041 (2000)

    Google Scholar 

  • Oguz, C., Lin, B.M.T., Cheng, T.C.E.: Two-stage flowshop scheduling with a common second-stage machine. Comput. Oper. Res. 24(12), 1169–1174 (1997)

    Article  MATH  Google Scholar 

  • Panwalkar, S.S., Smith, M.L., Koulamas, C.P.: A heuristic for the single machine tardiness problem. Eur. J. Oper. Res. 70(3), 304–310 (1993)

    Article  MATH  Google Scholar 

  • Paul, R.J.: A production scheduling problem in the glass-container industry. Oper. Res. 27(2), 290–302 (1979)

    Article  Google Scholar 

  • Quadt, D., Kuhn, H.: A taxonomy of flexible flow line scheduling procedures. Eur. J. Oper. Res. 178(3), 686–698 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  • Rajendran, C., Chaudhuri, D.: Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan. Int. J. Prod. Econ. 27(2), 137–143 (1992)

    Article  Google Scholar 

  • Riane, F., Artiba, A., Elmaghraby, S.E.: A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan. Eur. J. Oper. Res. 109(2), 321–329 (1998)

    Article  MATH  Google Scholar 

  • Ruiz, R., Maroto, C.: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur. J. Oper. Res. 169(3), 781–800 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Serifoglu, F.S., Ulusoy, G.: Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach. J. Oper. Res. Soc. 55(5), 504–512 (2004)

    Article  MATH  Google Scholar 

  • Soewandi, H., Elmaghraby, S.E.: Sequencing on two-stage hybrid flowshop with uniform machines to minimize makespan. IIE Trans. 35(5), 467–477 (2003)

    Article  Google Scholar 

  • Sriskandarajah, C., Sethi, S.P.: Scheduling algorithms for flexible flowshops: worst and average case performance. Eur. J. Oper. Res. 43(2), 143–160 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  • Sung, C.S., Choung, Y.I.: Minimizing makespan on a single burn-in oven in semiconductor manufacturing. Eur. J. Oper. Res. 120(3), 559–574 (2000)

    Article  MATH  Google Scholar 

  • Tang, L., Xuan, H., Liu, J.: A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time. Comput. Oper. Res. 33(11), 3344–3359 (2006)

    Article  MATH  Google Scholar 

  • Vosz, S., Witt, A.: Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: a real-world application. Int. J. Prod. Econ. 105(2), 445–458 (2007)

    Article  Google Scholar 

  • Wittrock, R.J.: An adaptable scheduling algorithm for flexible flow lines. Oper. Res. 36(3), 445–453 (1988)

    Article  MATH  Google Scholar 

  • Xuan, H., Tang, L.: Scheduling a hybrid flowshop with batch production at the last stage. Comput. Oper. Res. 34(9), 2718–2733 (2007)

    Article  MATH  Google Scholar 

  • Ying, K.-C., Lin, S.-W.: Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach. Int. J. Prod. Res. 44(16), 3161–3177 (2006)

    Article  MATH  Google Scholar 

  • 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Yuseong-gu, Daejeon, 305-701, Republic of Korea

    Yeong-Dae Kim & Byung-Jun Joo

  2. Institute of Production and Robotics, Ecole Polytechnique Federale de Lausanne, Batiment ME, Lausanne, 1015, Switzerland

    Jong-Ho Shin

Authors
  1. Yeong-Dae Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Byung-Jun Joo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jong-Ho Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yeong-Dae Kim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, YD., Joo, BJ. & Shin, JH. Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. J Heuristics 15, 19–42 (2009). https://doi.org/10.1007/s10732-007-9061-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-007-9061-z

Keywords

Search

Navigation