Skip to main content
SpringerLink
Log in

A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In this paper, we discuss a flexible flow shop scheduling problem with batch processing machines at each stage and with jobs that have unequal ready times. Scheduling problems of this type can be found in semiconductor wafer fabrication facilities (wafer fabs). We are interested in minimizing the total weighted tardiness of the jobs. We present a mixed integer programming formulation. The batch scheduling problem is NP-hard. Therefore, an iterative stage-based decomposition approach is proposed that is hybridized with neighborhood search techniques. The decomposition scheme provides internal due dates and ready times for the jobs on the first and second stage, respectively. Each of the resulting parallel machine batch scheduling problems is solved by variable neighborhood search in each iteration. Based on the schedules of the subproblems, the internal due dates and ready times are updated. We present the results of designed computational experiments that also consider the number of machines assigned to each stage as a design factor. It turns out that the proposed hybrid approach outperforms an iterative decomposition scheme where a fairly simple heuristic based on time window decomposition and the apparent tardiness cost dispatching rule is used to solve the subproblems. Recommendations for the design of the two stages with respect to the number of parallel machines on each stage are given.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Amin-Naseri, M. R., & Beheshti-Nia, M. A. (2009). Hybrid flow shop scheduling with parallel batching. International Journal of Production Economics, 117(1), 185–196.

    Article  Google Scholar 

  • Bellanger, A., & Oulamara, A. (2009). Scheduling hybrid flowshop with parallel batching machines and compatibilities. Computers & Operations Research, 36(6), 1982–1992.

    Article  Google Scholar 

  • Bilyk, A., Mönch, L., & Almeder, C. (2014). Scheduling jobs with ready time and precedence constraints on parallel batch machines using metaheuristics. Computers & Industrial Engineering, 78, 175–185.

    Article  Google Scholar 

  • Chen, C.-L., & Chen, C.-L. (2008). Bottleneck-based heuristic to minimize tardy jobs in a flexible flow line with unrelated parallel machines. International Journal of Production Research, 42(1), 165–181.

    Google Scholar 

  • Chen, C.-L., & Chen, C.-L. (2009). bottleneck-based heuristic to minimize total tardiness for the flexible flow line with unrelated parallel machines. Computers & Industrial Engineering, 56, 1393–1401.

    Article  Google Scholar 

  • Damodaran, P., & Srihari, K. (2004). Mixed integer formulation to minimize makespan in a flow shop with batch processing machines. Mathematical and Computer Modelling, 40(13), 1465–1472.

    Article  Google Scholar 

  • Demirkol, E., Mehta, S., & Uzsoy, R. (1997). A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics, 3, 111–137.

    Article  Google Scholar 

  • Demirkol, E., & Uzsoy, R. (2000). Decomposition methods for reentrant flow shops with sequence-dependent setup times. Journal of Scheduling, 3, 155–177.

    Article  Google Scholar 

  • Emmons, H., & Vairaktarakis, G. (2013). Flow shop scheduling: Theoretical results, algorithms, and applications. New York: Springer.

    Book  Google Scholar 

  • Fu, Q., Sivakumar, A. I., & Li, K. (2012). Optimizing of flow-shop scheduling with batch processor and limited buffer. International Journal of Production Research, 50(8), 2267–2285.

    Article  Google Scholar 

  • Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kann, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.

    Article  Google Scholar 

  • Hansen, P., & Mladenovic, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130, 449–467.

    Article  Google Scholar 

  • Jain, A. S., & Meeran, S. (2002). A multi-level hybrid framework applied to the general flow shop scheduling problem. Computers & Operations Research, 29, 1873–1901.

    Article  Google Scholar 

  • Klemmt, A., & Mönch, L. (2012). Scheduling jobs with time constraints between consecutive process steps in semiconductor manufacturing. In Proceedings of the 2012 Winter Simulation Conference (pp. 2173–2182).

  • Koulamas, C. (1998). A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem. Computers & Operations Research, 25(2), 83–89.

    Article  Google Scholar 

  • Lee, G.-C., Kim, Y.-D., & Choi, S.-W. (2004). Bottleneck-focused scheduling for a hybrid flowshop. International Journal of Production Research, 42(1), 165–181.

    Article  Google Scholar 

  • Lei, D., & Guo, X. (2011). Variable neighborhood search for minimizing tardiness objectives on flow shop with batch processing machines. International Journal of Production Research, 49(2), 519–529.

    Article  Google Scholar 

  • Liao, L.-M., & Huang, C.-J. (2010). Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness. Applied Mathematics and Computation, 217, 557–567.

    Article  Google Scholar 

  • Liao, L.-M., & Liao, C.-J. (2008). Improved MILP models for two-machine flowshop with batch processing machines. Mathematical and Computer Modeling, 48, 1254–1264.

    Article  Google Scholar 

  • Li, D., Meng, X., Liang, Q., & Zhao, J. (2015). A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines. Journal of Intelligent Manufacturing, 26(5), 873–890.

    Article  Google Scholar 

  • Manjeshwar, P. K., Damodaran, P., & Srihari, K. (2009). Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing. Robotics and Computer-Integrated Manufacturing, 25(3), 667–679.

    Article  Google Scholar 

  • Mathirajan, M., & Sivakumar, A. (2006). A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. International Journal of Advanced Manufacturing Technology, 29, 990–1001.

    Article  Google Scholar 

  • Mehta, S. V., & Uzsoy, R. (1998). Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions, 30(2), 165–178.

    Google Scholar 

  • Mönch, L., Balasubramanian, H., Fowler, J., & Pfund, M. (2005). Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers & Operations Research, 32(11), 2731–2750.

    Article  Google Scholar 

  • Mönch, L., Fowler, J. W., Dauzère-Pérès, S., Mason, S. J., & Rose, O. (2011). A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of Scheduling, 14(6), 583–595.

    Article  Google Scholar 

  • Mönch, L., Fowler, J. W., & Mason, S. J. (2013). Production planning and control for wafer fabrication facilities: Modeling, analysis, and systems. New York: Springer.

    Book  Google Scholar 

  • Mönch, L., Zimmermann, J., & Otto, P. (2006). Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines. Journal of Engineering Applications of Artificial Intelligence, 19(3), 235–245.

    Article  Google Scholar 

  • Mukherjee, S., & Chatterjee, A. K. (2006). Applying machine-based decomposition in 2-machine flow shops. European Journal of Operational Research, 169, 723–741.

    Article  Google Scholar 

  • Oulamara, A. (2012). No-wait scheduling problems with batching machines. Just-in-time systems. In R. Rios & Y. A. Ríos-Solís (Eds.), Optimization and its applications. Berlin: Springer.

    Google Scholar 

  • Robinson, J., Fowler, J. W., & Bard, J. F. (1995). The use of upstream and downstream information in scheduling semiconductor batch operations. International Journal of Production Research, 33(7), 1849–1869.

    Article  Google Scholar 

  • Ruiz, R., & Vázquez-Rodríguez, J. A. (2010). The hybrid flow shop scheduling problem. European Journal of Operational Research, 205(1), 1–18.

    Article  Google Scholar 

  • Shahnaghi, K., Shahmoradi-Moghadam, H., Noroozi, A., & Mokhtari, H. (2016). A robust modelling and optimisation framework for a batch processing flow shop production system in the presence of uncertainties. International Journal of Computer Integrated Manufacturing, 29(1), 92–106.

    Google Scholar 

  • Shen, L., Mönch, L., & Buscher, U. (2013). An iterative approach for the serial batching problem with parallel machines and job families. Annals of Operations Research, 206(1), 425–448.

    Article  Google Scholar 

  • Shen, L., Mönch, L., & Buscher, U. (2014). Simultaneous and iterative approach for parallel machine scheduling with sequence dependent family setups. Journal of Scheduling, 17(5), 471–487.

    Article  Google Scholar 

  • Su, L. H. (2003). A hybrid two-stage flow shop with limited waiting time constraints. Computers & Industrial Engineering, 44(3), 409–424.

    Article  Google Scholar 

  • Sung, C. S., & Kim, Y. H. (2002). Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Computers & Operations Research, 29(3), 275–294.

    Article  Google Scholar 

  • Sung, C. S., & Kim, Y. H. (2003). Minimizing due date related performance measures on two batch processing machines. European Journal of Operational Research, 147(3), 644–656.

    Article  Google Scholar 

  • Sung, C. S., Kim, Y. H., & Yoon, S. H. (2000). A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines. European Journal of Operational Research, 121(1), 179–192.

    Article  Google Scholar 

  • Tan, Y., Mönch, L., & Fowler, J. W. (2014). A decomposition heuristic for a two-machine flow shop with batch processing. In Proceedings of the 2014 Winter Simulation Conference (pp. 2490–2501).

  • Tan, Y., Mönch, L., & Fowler, J. W. (2015). Scheduling jobs in a two-stage flexible flow shop with batch processing machines. In Proceedings MISTA (pp. 801–804).

  • Uzsoy, R., Lee, C. Y., & Martin-Vega, L. A. (1992). A review of production planning and scheduling models in the semiconductor industry part I: System characteristics, performance evaluation and production planning. IIE Transactions on Scheduling and Logistics, 24(4), 47–61.

    Google Scholar 

  • Vepsalainen, A. P. J., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness cost. Management Science, 33(8), 1035–1047.

    Article  Google Scholar 

  • Vepsalainen, A. J. P., & Morton, T. E. (1988). Improving local priority rules with global lead-time estimates: A simulation study. Journal of Manufacturing and Operations Management, 1, 102–118.

    Google Scholar 

  • Wang, I.-L., Yang, T., & Chang, Y.-B. (2012). Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints. Journal of Intelligent Manufacturing, 23, 2271–2280.

    Article  Google Scholar 

  • Yang, Y., Kreipl, S., & Pinedo, M. (2000). Heuristics for minimizing total weighted tardiness in flexible job shops. Journal of Scheduling, 3, 89–108.

  • Yugma, C., Dauzère-Pérès, S., Artigues, C., Derreumaux, A., & Sibille, O. (2012). A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing. International Journal of Production Research, 50(8), 2118–2132.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Hagen, 58097, Hagen, Germany

    Yi Tan & Lars Mönch

  2. Department of Supply Chain Management, Arizona State University, Tempe, AZ, 85287-4706, USA

    John W. Fowler

Authors
  1. Yi Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lars Mönch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. John W. Fowler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lars Mönch.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tan, Y., Mönch, L. & Fowler, J.W. A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines. J Sched 21, 209–226 (2018). https://doi.org/10.1007/s10951-017-0530-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-017-0530-4

Keywords

Search

Navigation