Skip to main content
Springer Nature Link
Log in

Manufacturing synchronization in a hybrid flowshop with dynamic order arrivals

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

Abstract

Generally, order punctuality has received plenty of attention by manufacturers in order fulfillment. In order fabrication, jobs from a customer are often separately processed in dispersed manufacturing resources, such as different machines, facilities, or factories. This leads to the difficulties of processing customer orders in a simultaneous manner. This paper proposes a concept of manufacturing synchronization (MfgSync) and measures it from the perspective of simultaneity and punctuality. We study MfgSync of scheduling dynamic arrival orders in a hybrid flowshop. To deal with the dynamic order arrival environment, we schedule the coming orders in a periodic manner so that the dynamic scheduling problem is decomposed into a series of continuous static sub-problems. A base model for each sub-problem is mathematically formulated to minimize the simultaneity of order fabrication measured by mean longest waiting duration considering the order punctuality constraint. We then present a solution algorithm consisting of a periodic scheduling policy and a modified genetic algorithm. Numerical studies demonstrate the effectiveness of the proposed approach. The results also show that bottleneck position has a considerable impact on MfgSync, and we can obtain better MfgSync for the systems with entrance bottlenecks compared to middle and exist bottlenecks. And it is suggested to choose a larger decision interval in off season compared to peak season.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

  • Ahmadi, R. H., & Bagchi, U. (1990). Scheduling of multi-job customer orders in multi-machine environments. Philadelphia: ORSA/TIMS.

    Google Scholar 

  • Ahmadi, R. H., Bagchi, U., & Roemer, T. A. (2005). Coordinated scheduling of customer orders for quick response. Naval Research Logistics: NRL, 52(6), 493–512.

    Article  Google Scholar 

  • Ahmadi, R. H., & Wurgaft, H. (1994). Design for synchronized flow manufacturing. Management Science, 40(11), 1469–1483.

    Article  Google Scholar 

  • Becker, C., & Scholl, A. (2006). A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research, 168(3), 694–715.

    Article  Google Scholar 

  • Blackstone, J. H. (2001). Theory of constraints—A status report. International Journal of Production Research, 39(6), 1053–1080.

    Article  Google Scholar 

  • Chaouiya, C., Liberopoulos, G., & Dallery, Y. (2000). The extended kanban control system for production coordination of assembly manufacturing systems. Iie Transactions, 32(10), 999–1012.

    Google Scholar 

  • Chen, J., Huang, G. Q., Luo, H., & Wang, J. Q. (2015). Synchronisation of production scheduling and shipment in an assembly flowshop. International Journal of Production Research, 53(9), 2787–2802.

    Article  Google Scholar 

  • Deb, K. (2000). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186(2), 311–338.

    Article  Google Scholar 

  • Fu, Y. P., Wang, H. F., Huang, M. G., & Wang, J. W. (2016). A decomposition based multiobjective genetic algorithm with adaptive multipopulation strategy for flowshop scheduling problem. Natural Computing (in press).

  • Gupta, J. N., Ho, J. C., & van der Veen, J. A. (1997). Single machine hierarchical scheduling with customer orders and multiple job classes. Annals of Operations Research, 70, 127–143.

    Article  Google Scholar 

  • Hsu, S. Y., & Liu, C. H. (2009). Improving the delivery efficiency of the customer order scheduling problem in a job shop. Computers & Industrial Engineering, 57(3), 856–866.

    Article  Google Scholar 

  • Kumar, C. S., & Panneerselvam, R. (2007). Literature review of JIT-KANBAN system. The International Journal of Advanced Manufacturing Technology, 32(3–4), 393–408.

    Article  Google Scholar 

  • Leung, J. Y.-T., Li, H., & Pinedo, M. (2005). Order scheduling in an environment with dedicated resources in parallel. Journal of Scheduling, 8(5), 355–386.

    Article  Google Scholar 

  • Li, C.-L., & Ou, J. (2007). Coordinated scheduling of customer orders with decentralized machine locations. Iie Transactions, 39(9), 899–909.

    Article  Google Scholar 

  • Lin, B. M., & Kononov, A. V. (2007). Customer order scheduling to minimize the number of late jobs. European Journal of Operational Research, 183(2), 944–948.

    Article  Google Scholar 

  • Murata, T., Ishibuchi, H., & Tanaka, H. (1996). Multi-objective genetic algorithm and its applications to flowshop scheduling. Computers & Industrial Engineering, 30(4), 957–968.

    Article  Google Scholar 

  • Nagano, M. S., Ruiz, R., & Lorena, L. A. N. (2008). A constructive genetic algorithm for permutation flowshop scheduling. Computers & Industrial Engineering, 55(1), 195–207.

    Article  Google Scholar 

  • Oĝuz, C., & Ercan, M. F. (2005). A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Journal of Scheduling, 8(4), 323–351.

    Article  Google Scholar 

  • Ouelhadj, D., & Petrovic, S. (2009). A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling, 12(4), 417–431.

    Article  Google Scholar 

  • Ovacikt, I., & Uzsoy, R. (1994). Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. The International Journal of Production Research, 32(6), 1243–1263.

    Article  Google Scholar 

  • Reeves, C. R. (1995). A genetic algorithm for flowshop sequencing. Computers & Operations Research, 22(1), 5–13.

    Article  Google Scholar 

  • Riezebos, J. (2011). Order sequencing and capacity balancing in synchronous manufacturing. International Journal of Production Research, 49(2), 531–552.

    Article  Google Scholar 

  • Sabuncuoglu, I., & Karabuk, S. (1999). Rescheduling frequency in an FMS with uncertain processing times and unreliable machines. Journal of Manufacturing Systems, 18(4), 268–283.

    Article  Google Scholar 

  • Sirikrai, V., & Yenradee, P. (2006). Modified drum-buffer-rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation. International Journal of Production Research, 44(17), 3509–3531.

    Article  Google Scholar 

  • Su, L.-H., Chen, P.-S., & Chen, S.-Y. (2013). Scheduling on parallel machines to minimise maximum lateness for the customer order problem. International Journal of Systems Science, 44(5), 926–936.

    Article  Google Scholar 

  • Takahashi, K., & Hirotani, D. (2005). Comparing CONWIP, synchronized CONWIP, and Kanban in complex supply chains. International Journal of Production Economics, 93, 25–40.

    Article  Google Scholar 

  • Van Laarhoven, P. J., & Aarts, E. H. (1987). Simulated annealing. In Simulated annealing: Theory and applications (pp. 7–15). Netherlands: Springer.

  • Vieira, G. E., Herrmann, J. W., & Lin, E. (2003). Rescheduling manufacturing systems: A framework of strategies, policies, and methods. Journal of Scheduling, 6(1), 39–62.

    Article  Google Scholar 

  • Wang, G. Q., & Cheng, T. C. E. (2007). Customer order scheduling to minimize total weighted completion time. Omega, 35(5), 623–626.

    Article  Google Scholar 

  • Wang, H. F., Fu, Y. P., Huang, M. G., Huang, G. Q., & Wang, J. W. (2016). A hybrid evolutionary algorithm with adaptive multi-population strategy for multi-objective optimization problems. Soft Computing, 1–13.

  • Wang, J. W., & Wang, D. W. (2008). Particle swarm optimization with a leader and followers. Progress in Natural Science, 18(11), 1437–1443.

    Article  Google Scholar 

  • Wang, J. W., Wang, H. F., Ip, W. H., Furuta, K., Kanno, T., & Zhang, W. J. (2013). Predatory search strategy based on swarm intelligence for continuous optimization problems.Mathematical Problems in Engineering, 2013.

  • Watson, K. J., Blackstone, J. H., & Gardiner, S. C. (2007). The evolution of a management philosophy: The theory of constraints. Journal of Operations Management, 25(2), 387–402.

    Article  Google Scholar 

  • Yang, J. (2005). The complexity of customer order scheduling problems on parallel machines. Computers & Operations Research, 32(7), 1921–1939.

    Article  Google Scholar 

  • Yang, J., & Posner, M. E. (2005). Scheduling parallel machines for the customer order problem. Journal of Scheduling, 8(1), 49–74.

    Article  Google Scholar 

  • Yeniay, Ö. (2005). Penalty function methods for constrained optimization with genetic algorithms. Mathematical and Computational Applications, 10(1), 45–56.

    Article  Google Scholar 

  • Yu, X. J., & Gen, M. (2010). Introduction to evolutionary algorithms. London: Springer Science & Business Media.

Download references

Acknowledgements

Authors are grateful to the Zhejiang Provincial, Hangzhou Municipal and Lin’an City governments for partial financial supports. This work is supported by National Natural Science Foundation of China (Grant Nos. 61473093, and 61540030), and Project Funded by Guangdong Provincial Department of Science and Technology (2014B050502014, 2014A040401079); supported by Open Fund of State Key Laboratory of Intelligent Manufacturing System Technology.

Author information

Authors and Affiliations

  1. College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing, 211106, China

    Jian Chen

  2. HKU-ZIRI Lab for Physical Internet, Department of Industrial and Manufacturing Systems Engineering, The University of Hong Kong, Pokfulam Road, Pokfulam, Hong Kong, People’s Republic of China

    Jian Chen, Meilin Wang, Xiang T. R. Kong & George Q. Huang

  3. School of Information Engineering, Guangdong University of Technology, Guangzhou, China

    Meilin Wang

  4. Guangdong Polytechnical Normal University, Guangzhou, China

    Qinyun Dai

  5. State Key Laboratory of Intelligent Manufacturing System Technology, Beijing, 100854, China

    Guoqiang Shi

Authors
  1. Jian Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Meilin Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Xiang T. R. Kong
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. George Q. Huang
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Qinyun Dai
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. Guoqiang Shi
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Meilin Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, J., Wang, M., Kong, X.T.R. et al. Manufacturing synchronization in a hybrid flowshop with dynamic order arrivals. J Intell Manuf 30, 2659–2668 (2019). https://doi.org/10.1007/s10845-017-1295-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-017-1295-5

Keywords

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy