Skip to main content
SpringerLink
Log in

Scheduling Heuristic to Satisfy Due Dates of the Customer Orders in Mass Customized Service Industry

  • Conference paper
  • First Online:
Mobility Internet of Things 2018 (Mobility IoT 2018)

Part of the book series: EAI/Springer Innovations in Communication and Computing ((EAISICC))

  • 701 Accesses

Abstract

In service industries where mass operations along with mass customization are demanding, they are keen in minimizing all factors such as total process time, waiting time, and movement time for a cost-effective environment and customer satisfaction. In such situations, maintaining customers to a satisfied level, optimal due date plays a vital role. Also the customers may not be ready in waiting for more than just in time. Keeping all these in mind a model is proposed to find out optimal batch size and corresponding makespan that satisfies required due date(s) for all possible clients of municipal services, such as patients of hospitals. A simple heuristics-based algorithm for mass customization is developed that finds the near-optimal solution for different categories of patients. The search algorithm offers better results which show that the model is effective in such given conditions. The results show that the proposed method performs well in such type of problems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Davis, S. M. (1987). Future perfect. Boston: Addison-Wesley.

    Google Scholar 

  2. Phanindra Kumar Chadalavada University of Kentucky Master's Theses Graduate School. (2006). Minimum flow time schedule genetic algorithm for mass customization manufacturing using minicells.

    Google Scholar 

  3. Zhang, Z., Wenming, C., Lin, S. & Qingliang, Y. (2009). An ant based algorithm for balancing assembly lines in a mass customization environment IEEE 1–4.

    Google Scholar 

  4. Noorul, H. A., Jayaprakash, J., & Rengarajan, K. (2006). A hybrid genetic algorithm approach to mixed-model assembly line balancing. International Journal of Advanced Manufacturing Technology, 28, 337–341.

    Article  Google Scholar 

  5. Boysen, N., Scholl, A., & Wopperer, N. (2012). Resequencing of mixed-model assembly lines: Survey and research agenda. European Journal of Operational Research, 216, 594–604.

    Article  Google Scholar 

  6. Rahimi-Vahed, A. R., Rabbani, M., Tavakkoli-Moghaddam, R., Torabi, S. A., & Jolai, F. (2007). A multi-objective scatter search for a mixed-model assembly line sequencing problem. Advanced Engineering Informatics, 21, 85–99.

    Article  Google Scholar 

  7. Modrak, V., & Marton, D. (2012). Modelling and complexity assessment of assembly supply chain systems. Procedia Engineering, 48, 428–435.

    Article  Google Scholar 

  8. Modrak, V., & Marton, D. (2014). Configuration complexity assessment of convergent supply chain systems. International Journal of General Systems, 43(5), 508–520.

    Article  MathSciNet  Google Scholar 

  9. Franz, C., Hällgren, E. C., & Koberstein, A. (2014). Resequencing orders on mixed-model assembly lines: Heuristic approaches to minimise the number of overload situations. International Journal of Production Research, 52(19), 5823–5840.

    Article  Google Scholar 

  10. Gujjula, R. & Günther, H.O. (2009). Resequencing mixed-model assembly lines under just in-sequence constraints. In: International conference on computers and industrial engineering (CIE 2009). IEEE; (pp. 668–73).

    Google Scholar 

  11. Valero-Herrero, M., Garcia-Sabater, J. P., Vidal-Carreras, P. I., & Canos-Daros, L. (2014). Solving the car resequencing problem with mix banks. Dirección y Organización, 54, 36–44.

    Google Scholar 

  12. Gaia, N., Pacciarelli, D., & Pacifici, A. (2002). Optimally balancing assembly lines with different workstations. Discrete Applied Mathematics, 118, 99–113.

    Article  MathSciNet  Google Scholar 

  13. Taube, F., & Minner, S. (2018). Resequencing mixed-model assembly lines with restoration to customer orders. Omega, 78, 99–111.

    Article  Google Scholar 

  14. Merengo, C., Nava, F., & Pozetti, A. (1999). Balancing and sequencing manual mixed-model assembly lines. International Journal of Production Research, 37, 2835–2860.

    Article  Google Scholar 

  15. Bukchin, J., & Rubinovitz, J. (2002). A weighted approach for assembly line design with station paralleling and equipment selection. IIE Transactions, 35, 573–585.

    Google Scholar 

  16. Burns, L. D., & Daganzo, C. F. (1987). Assembly line job sequencing principles. International Journal of Production Research, 25, 71–99.

    Article  Google Scholar 

  17. Blackstone, J. H., Phillips, D. T., & Hogg, G. L. (1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20, 27–45.

    Article  Google Scholar 

  18. Mane, J. K., & Ghadle, K. P. (2012). Common due-date assignment and job scheduling on single machine and parallel machines. In The bulletin of Society for Mathematical Services and Standards. Online: 2012-03-01 ISSN: 2277-8020 (Vol. 1, pp. 6–13).

    Google Scholar 

  19. Baker, K. R., & Bertrand, J. W. M. (1980). A comparison of due-date selection rules, industrial engr. Report 1980/02. Eindhoven: University of Technology.

    Google Scholar 

  20. Kim, Y. K., Kim, Y., & Kim, Y. J. (2000a). Two-sided assembly line balancing: A genetic algorithm approach. Production Planning & Control, 11, 44–53.

    Article  Google Scholar 

  21. Castillo, F., & Gazmuri, P. (2015). Genetic algorithms for batch sizing and production scheduling. International Journal of Advanced Manufacturing Technology, 77, 261–280.

    Article  Google Scholar 

  22. Modrak, V., & Pandian, R. S. (2010). Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem. Tehnicki Vjesnik-Technical Gazette, 17(3), 273–278.

    Google Scholar 

  23. Semanco, P., & Modrak, V. (2012). A comparison of constructive heuristics with the objective of minimizing makespan in the flow-shop scheduling problem. Acta Polytechnica Hungarica, 9.5, 177–190.

    Google Scholar 

Download references

Acknowledgement

The authors gratefully acknowledge the contribution of the Scientific Grant Agency of the Ministry of Education, Science, Research and Sport of the Slovak Republic-VEGA under the grant No. 1/0419/16.

This publication is the partial result of the project that received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement number 734713.

Author information

Authors and Affiliations

  1. Vellore Institute of Technology [VIT], Vellore, India

    R. Sudhakara Pandian

  2. Technical University of Kosice, Kosice, Slovakia

    V. Modrak & Z. Soltysova

  3. Lear Corporation, Presov, Slovakia

    P. Semanco

Authors
  1. R. Sudhakara Pandian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Modrak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Z. Soltysova
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. P. Semanco
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Industrial Engineering and Management, Faculty of Materials Science and Technology in Trnava, Slovak University of Technology in Bratislava, Trnava, Bratislava, Slovakia

    Dagmar Cagáňová

  2. Institute of Industrial Engineering and Management, Faculty of Materials Science and Technology in Trnava, Slovak University of Technology in Bratislava, Trnava, Bratislava, Slovakia

    Natália Horňáková

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sudhakara Pandian, R., Modrak, V., Soltysova, Z., Semanco, P. (2020). Scheduling Heuristic to Satisfy Due Dates of the Customer Orders in Mass Customized Service Industry. In: Cagáňová, D., Horňáková, N. (eds) Mobility Internet of Things 2018. Mobility IoT 2018. EAI/Springer Innovations in Communication and Computing. Springer, Cham. https://doi.org/10.1007/978-3-030-30911-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-30911-4_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-30910-7

  • Online ISBN: 978-3-030-30911-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation