Skip to main content
Log in

Production scheduling problem in a factory of automobile component primer painting

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

In a factory of automobile component primer painting, various automobile parts are attached to overhead hangers in a conveyor line and undergo a series of coating processes. Thereafter, the components are wrapped at a packaging station. The packaging process should be fully balanced by an appropriate sequence of components to prevent the bottleneck effect because each component requires different packaging times and materials. An overhead hanger has a capacity limit and can hold varying numbers of components depending on the component type. Capacity loss can occur if the hanger capacity is not fully utilized. To increase hanger utilization, companies sometimes mix two or more component types on the same hangers, and these hangers are called mixed hangers. However, mixed hangers generally cause heavy workload because different items require additional setup times during hanging and packing processes. Hence, having many mixed hangers is not recommended. A good production schedule requires a small number of mixed hangers and maximizes hanger utilization and packaging workload balance. We show that the scheduling problem is NP-hard and develop a mathematical programming model and efficient solution approaches for the problem. When applying the methods to solve real problems, we also use an initial solution-generating method that minimizes the mixing cost, set a rule for hanging the items on hangers considering eligibility constraint, and decrease the size of tabu list in proportion to the remaining computational time for assuring intensification in the final iterations of the search. Experimental results demonstrate the effectiveness of the proposed approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Ahani, G., & Asyabani, M. (2014). A tabu search algorithm for no-wait job shop scheduling problem. International Journal of Operational Research,19(2), 246–258.

    Google Scholar 

  • Ahonen, H., & de Alvarenga, A. G. (2017). Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: Formulation and solution procedures. The International Journal of Advanced Manufacturing Technology,89, 765–777.

    Google Scholar 

  • Allahverdi, A. (2016). A survey of scheduling problems with no-wait in process. European Journal of Operations Research,255, 665–686.

    Google Scholar 

  • Allahverdi, A., & Aydilek, H. (2013). Algorithms for no-wait flowshops with total completion time subject to makespan. The International Journal of Advanced Manufacturing Technology,68, 2237–2251.

    Google Scholar 

  • Allahverdi, A., & Aydilek, H. (2014). Total completion time with makespan constraint in no-wait flowshops with setup times. European Journal of Operations Research,238, 724–734.

    Google Scholar 

  • Arabameri, S., & Salmasi, N. (2013). Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem. Computers & Industrial Engineering,64(4), 902–916.

    Google Scholar 

  • Baykasoğlu, A., & Ozsoydan, F. B. (2018). Dynamic scheduling of parallel heat treatment furnaces: a case study at a manufacturing system. Journal of Manufacturing Systems,46, 152–162.

    Google Scholar 

  • Behnamian, J., & Fatemi Ghomi, S. M. T. (2016). A survey of multi-factory scheduling. Journal of Intelligent Manufacturing,27(1), 231–249.

    Google Scholar 

  • Behnamian, J., Fatemi Ghomi, S. M. T., Jolai, F., & Amirtaheri, O. (2012). Realistic two-stage flowshop batch scheduling problems with transportation capacity and times. Applied Mathematical Modelling,36, 723–735.

    Google Scholar 

  • Bektur, G., & Saraç, T. (2019). A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server. Computers & Operations Research,103, 46–63.

    Google Scholar 

  • Bożejko, W., & Makuchowski, M. (2009). A fast hybrid tabu search algorithm for the no-wait job shop problem. Computers & Industrial Engineering,56(4), 1502–1509.

    Google Scholar 

  • Coffman, E. G., Garey, M. R., & Johnson, D. S. (1997). Approximation algorithms for bin-packing: a survey. In D. S. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 46–93). Boston: PWS Publishing Company.

    Google Scholar 

  • Dallasega, P., Rojas, R. A., Bruno, G., & Rauch, E. (2019). An agile scheduling and control approach in ETO construction supply chains. Computers in Industry,112, 103122.

    Google Scholar 

  • Damodaran, P., Rao, A. G., & Mestry, S. (2013). Particle swarm optimization for scheduling batch processing machines in a permutation flowshop. The International Journal of Advanced Manufacturing Technology,64, 989–1000.

    Google Scholar 

  • Ding, J.-Y., Song, S., Gupta, J. N. D., Zhang, R., Chiong, R., & Wu, C. (2015). An improved iterated greedy algorithm with a tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing,30, 604–613.

    Google Scholar 

  • Fleszar, K., & Charalambous, C. (2011). Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. European Journal of Operational Research,210, 176–184.

    Google Scholar 

  • Fuchigami, H. Y., & Rangel, S. (2018). A survey of case studies in production scheduling: Analysis and perspectives. Journal of Computational Science,25, 425–436.

    Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: WH Freeman.

    Google Scholar 

  • Hejazi, S. R., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: a review. International Journal of Operational Research,43, 2895–2929.

    Google Scholar 

  • Henao, R., Sarache, W., & Gómez, I. (2019). Lean manufacturing and sustainable performance: trends and future challenges. Journal of Cleaner Production,208, 99–116.

    Google Scholar 

  • Johansen, S. G. (2019). Emergency orders in the periodic-review inventory system with fixed ordering costs and stochastic lead times for normal orders. International Journal of Production Economics,209, 205–214.

    Google Scholar 

  • Kim, Y.-D., Joo, B.-J., & Shin, J.-H. (2009). Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. Journal of Heuristics,15, 19–42.

    Google Scholar 

  • Koulamas, C., & Panwalkar, S. S. (2018). New index priority rules for no-wait flow shops. Computers & Industrial Engineering,115, 647–652.

    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.

    Google Scholar 

  • Liaw, C. F. (2008). An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops. Computers & Operations Research,35(10), 3276–3283.

    Google Scholar 

  • Lin, B. M. T., & Cheng, T. C. E. (2001). Batch scheduling in the no-wait two-machine flowshop to minimize the makespan. Computers & Operations Research,28, 613–624.

    Google Scholar 

  • Liu, C., Chen, H., Xu, R., & Wang, Y. (2018). Minimizing the resource consumption of heterogeneous batch-processing machines using a copula-based estimation of distribution algorithm. Applied Soft Computing,73, 283–305.

    Google Scholar 

  • Masmoudi, O., Yalaoui, A., Ouazene, Y., & Chehade, H. (2016). Multi-item capacitated lot-sizing problem in a flow-shop system with energy consideration. IFAC-PapersOnLine,49(12), 301–306.

    Google Scholar 

  • Matin, H. N. Z., Salmasi, N., & Shahvari, O. (2017). Makespan minimization in flowshop batch processing problem with different batch compositions on machines. International Journal of Production Economics,193, 832–844.

    Google Scholar 

  • Mendez, C. A., Cerda, J., Grossmann, I. E., Harjunkoski, I., & Fahl, M. (2006). State-of-the-art review of optimization methods for short-term scheduling of batch processes. Computers & Chemical Engineering,30, 913–946.

    Google Scholar 

  • Mohammadi, S., Mirzapour Al-e-Hashem, S. M. J., & Rekik, Y. (2020). An integrated production scheduling and delivery route planning with multi-purpose machines: A case study from a furniture manufacturing company. International Journal of Production Economics,219, 347–359.

    Google Scholar 

  • Oulamara, A. (2007). Makespan minimization in a no-wait flow shop problem with two batching machines. Computers & Operations Research,34, 1033–1050.

    Google Scholar 

  • Oulamara, A. (2012). No-wait scheduling problems with batching machines. In R. Z. Ríos-Mercado & Y. A. Ríos-Solís (Eds.), Just-in-time systems (pp. 147–168). New York: Springer.

    Google Scholar 

  • Oulamara, A., Kovalyov, M. Y., & Finke, G. (2005). Scheduling a no-wait flow shop containing unbounded batching machines. IIE Transactions,37, 685–696.

    Google Scholar 

  • Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operations Research,120, 228–249.

    Google Scholar 

  • Potts, C. N., & Strusevich, V. A. (2009). Fifty years of scheduling: a survey of milestones. Journal of the Operational Research Society,60(1), 41–68.

    Google Scholar 

  • Ropke, S., & Pisinger, D. (2006). An adaptive large neighbourhood search heuristic for the pickup and delivery problem with time windows. Transportation Science,40, 455–472.

    Google Scholar 

  • Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operations Research,165, 479–494.

    Google Scholar 

  • Salmasi, N., Logendran, R., & Skandari, M. R. (2011). Makespan minimization of a flowshop sequence-dependent group scheduling problem. The International Journal of Advanced Manufacturing Technology,56, 699–710.

    Google Scholar 

  • Samarghandi, H., & Behroozi, M. (2017). On the exact solution of the no-wait flow shop problem with due date constraints. Computers & Operations Research,81, 141–159.

    Google Scholar 

  • Sapkal, S. U., & Laha, D. (2013). A heuristic for no-wait flow shop scheduling. The International Journal of Advanced Manufacturing Technology,68, 1327–1338.

    Google Scholar 

  • Sawik, T. (2002). An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Mathematical and Computer Modelling,36, 461–471.

    Google Scholar 

  • Schuster, C. J. (2006). No-wait job scheduling: tabu search and complexity of subproblems. Mathematical Methods of Operations Research,63(3), 473–491.

    Google Scholar 

  • Selen, W. J., & Hott, D. D. (1986). A new formulation and solution of the flowshop scheduling problem with no in-process waiting. Applied Mathematical Modelling,10, 246–248.

    Google Scholar 

  • Stefansdottir, B., Grunow, M., & Akkerman, R. (2017). Classifying and modeling setups and cleanings in lot sizing and scheduling. European Journal of Operations Research,261, 849–865.

    Google Scholar 

  • Sun, Y., Zhang, C., Gao, L., & Wang, X. (2011). Multi-objective optimization algorithms for flow shop scheduling problem: A review and prospects. The International Journal of Advanced Manufacturing Technology,55, 723–739.

    Google Scholar 

  • Tang, L., & Liu, P. (2009a). Minimizing makespan in a two-machine flowshop scheduling with batching and release time. Mathematical and Computer Modelling,49, 1071–1077.

    Google Scholar 

  • Tang, L., & Liu, P. (2009b). Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration. Applied Mathematical Modelling,33, 1187–1199.

    Google Scholar 

  • Tasgetiren, M. F., Pan, Q.-K., Suganthan, P. N., & Chua, T. J. (2011). A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. International Journal of Operational Research,49, 5033–5050.

    Google Scholar 

  • Wang, C., Li, X., & Wang, Q. (2010). Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion. European Journal of Operations Research,206(1), 64–72.

    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(6), 2271–2280.

    Google Scholar 

  • Yin, S., Nishi, T., & Zhang, G. (2015). A game theoretic model for coordination of single manufacturer and multiple suppliers with quality variations under uncertain demands. International Journal of Systems Science: Operations & Logistics,3(2), 79–91.

    Google Scholar 

  • Zhou, S., Li, X., Chen, H., & Guo, C. (2016). Minimizing makespan in a no-wait flowshop with two batch processing machines using estimation of distribution algorithm. International Journal of Operational Research,54(16), 4919–4937.

    Google Scholar 

Download references

Acknowledgments

This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korean government (No. 2016R1A2B4012177 and No. NRF-2019R1F1A1058165) and the Brain Korea 21 Postdoctoral Program.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Byung-In Kim.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singgih, I.K., Yu, O., Kim, BI. et al. Production scheduling problem in a factory of automobile component primer painting. J Intell Manuf 31, 1483–1496 (2020). https://doi.org/10.1007/s10845-019-01524-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-019-01524-6

Keywords

Navigation