Skip to main content
SpringerLink
Log in

Production Planning for Make-to-Order Flow Shop System Under Hierarchical Workforce Environment

  • Conference paper
Transactions on Engineering Technologies

Abstract

In make-to-order system orders are scheduled for production based on the due date agreed with customer and the strategy of company. Production planning of such system includes scheduling of orders to the production periods and allocation of workers at different work centers. Complexity in the system arises when the operation to perform next and its processing time is skilled dependent where a higher qualified worker type can substitute a lower qualified one, but not vice-versa. Under such working environment, efficient scheduling of orders and allocation of workers at different work center play major role to improve system performance. This paper develops a mathematical model for make-to-order flow shop system under hierarchical workforce environment. The model helps identify optimum schedule of orders and allocation of workers with an objective of minimizing the weighted average earliness and tardiness. A heuristic method is also proposed to overcome the complexity of mathematical model and solve the problem efficiently. Numerical analysis indicates that proposed heuristic is capable of finding optimal or near optimal solution in a considerably reduced amount of computational timing.

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. Gallien, J., Tallec, Y.L., Schoenmery, T.: A Model for Make to Order Revenue Management. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA (2004) (Working Paper)

    Google Scholar 

  2. Kreamer, K.L., Dedrick, J., Yamashiro, S.: Refining and extending the business model with information technology: Dell computer corporation. Inf. Soc. 16, 5–21 (2000)

    Article  Google Scholar 

  3. Piya, S., Katsuhiko, T., Katsumi, M.: Introducing quotation and negotiation structure in the order acceptance decision model. Int. J. Oper. Quant. Manag. 15(4), 293–318 (2009)

    Google Scholar 

  4. Piya, S., Al-Hinai, N. Production planning under hierarchical workforce environment. Lecture Notes in Engineering and Computer Science: Proceedings of the World Congress on Engineering 2014, WCE 2014, London, 2–4 July 2014, pp. 1029–1033

    Google Scholar 

  5. Applegate, D., Cook, W.: A computational study of the job shop scheduling problem. ORSA J. Comput. 02, 149–157 (1991)

    Article  Google Scholar 

  6. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41, 157–183 (1993)

    Article  MATH  Google Scholar 

  7. Lee, I., Shaw, M.J.: A neural net approach to real time flow shop sequencing. Comput. Ind. Eng. 38, 125–147 (2000)

    Article  Google Scholar 

  8. Kacem, I., Hammadi, S., Brone, P.: Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Syst. Man Cybern. 32(1), 1–13 (2002)

    Article  Google Scholar 

  9. Toktas, B., Azizoglu, M., Koksalan, S.K.: Two machine flow shop scheduling with two criteria: maximum earliness and makespan. Eur. J. Oper. Res. 64, 278–285 (2004)

    Google Scholar 

  10. Tang, L., Liu, J., Liu, W.: A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. J. Intell. Manuf. 16, 361–370 (2005)

    Article  Google Scholar 

  11. Liu, L., Gu, H., Xi, Y.: Robust and stable scheduling of a single machine with random machine breakdowns. Int. J. Adv. Manuf. Technol. 31, 645–654 (2007)

    Article  Google Scholar 

  12. Yagamahan, B., Yenise, M.: Ant colony optimization for multi-objective flow shop scheduling problem. Comput. Ind. Eng. 54(3), 411–420 (2008)

    Article  Google Scholar 

  13. Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35, 3202–3212 (2008)

    Article  MATH  Google Scholar 

  14. Xia, Y., Chen, B., Yue, J.: Job sequencing and due date assignment in a single machines shop with uncertain processing times. Eur. J. Oper. Res. 184, 63–75 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  15. Manikas, A., Chang, Y.L.: Multi-criteria sequence-dependent job shop scheduling using genetic algorithms. Comput. Ind. Eng. 56(1), 179–185 (2009)

    Article  Google Scholar 

  16. Sha, D.Y., Lin, H.H.: A multi-objective PSO for job-shop scheduling problems. Expert Syst. Appl. 37(2), 1065–1070 (2010)

    Article  Google Scholar 

  17. Al-Hinai, N., El Mekkawy, T.Y.: Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. Int. J. Prod. Econ. 132, 279–291 (2011)

    Article  Google Scholar 

  18. Seckiner, S.U., Gokcen, H., Kurt, M.: An integer programming model for hierarchical workforce scheduling problem. Eur. J. Oper. Res. 183, 694–699 (2007)

    Article  MATH  Google Scholar 

  19. Emmons, H., Burns, R.N.: Off-day scheduling with hierarchical worker categories. Oper. Res. 39, 484–495 (1991)

    Article  MATH  Google Scholar 

  20. Hung, R.: Single-shift off-day scheduling of a hierarchical workforce with variable demands. Eur. J. Oper. Res. 78, 49–57 (1994)

    Article  MATH  Google Scholar 

  21. Narasihman, R.: An algorithm for single shift scheduling of hierarchical workforce. Eur. J. Oper. Res. 96, 113–121 (1996)

    Article  Google Scholar 

  22. Billonnet, A.: Integer programming to schedule a hierarchical workforce with variable demands. Eur. J. Oper. Res. 114, 105–114 (1999)

    Article  Google Scholar 

  23. Narashiman, R.: An algorithm for multiple shift scheduling of hierarchical workforce on four-day or three-day workweeks. INFOR 38, 14–32 (2000)

    Google Scholar 

  24. Al-Yaqoob, S.M., Sherali, H.D.: Multiple shift scheduling of hierarchical workforce with multiple work centers. J. Inf. 18(3), 325–342 (2007)

    Google Scholar 

  25. Pastor, R., Corominas, A.: A bicriteria integer programming model for the hierarchical workforce scheduling problem. J. Model. Manag. 5, 54–62 (2010)

    Article  Google Scholar 

  26. Ozguven, C., Sungur, B.: Integer programming models for hierarchical workforce scheduling problems including excess off-days and idle labor times. Appl. Math. Model. 37, 9117–9131 (2013)

    Article  MathSciNet  Google Scholar 

  27. Koulamas, C.: The total tardiness problem: review and extensions. Oper. Res. 42(6), 1025–1041 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgment

The research was supported by the internal research grant (IG/ ENG/MIED/ 14/05) from Sultan Qaboos University. This support is gratefully acknowledged.

Author information

Authors and Affiliations

  1. Department of Mechanical and Industrial Engineering, College of Engineering, Sultan Qaboos University, AL-Khod 123, Muscat, Sultanate of Oman

    Sujan Piya & Nasr Al-Hinai

Authors
  1. Sujan Piya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nasr Al-Hinai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sujan Piya .

Editor information

Editors and Affiliations

  1. Multimedia Engineering College of Engioneering, Mokpo National University, Chonnam, Korea, Republic of (South Korea)

    Gi-Chul Yang

  2. IAENG Secretariat, International Association of Engineers, Hong Kong, Hong Kong SAR

    Sio-Iong Ao

  3. Dept of Applied Mathematics & Computing School of Engineering, Cranfield University, Cranfield, Bedfordshire, United Kingdom

    Len Gelman

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Piya, S., Al-Hinai, N. (2015). Production Planning for Make-to-Order Flow Shop System Under Hierarchical Workforce Environment. In: Yang, GC., Ao, SI., Gelman, L. (eds) Transactions on Engineering Technologies. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-9804-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-9804-4_21

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-017-9803-7

  • Online ISBN: 978-94-017-9804-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation