Skip to main content

Advertisement

SpringerLink
Log in

Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design

  • Original Research
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In collaborative manufacturing, the supply chain scheduling problem becomes more complex according to both multiple product demands and multiple production modes. Aiming to obtain a reasonable solution to this complexity, we analyze the characteristics of collaborative manufacturing and design some elements, including production parameters, order parameters, and network parameters. We propose four general types of collaborative manufacturing networks and then construct a supply chain scheduling model composed of the processing costs, inventory costs, and two penalty costs of the early completion costs and tardiness costs. In our model, by considering the urgency of different orders, we design a delivery time window based on the least production time and slack time. Additionally, due to the merit of continuously processing orders belonging to the same product type, we design a production cost function by using a piecewise function. To solve our model efficiently, we present a hybrid ant colony optimization (HACO) algorithm. More specifically, the Monte Carlo algorithm is incorporated into our HACO algorithm to improve the solution quality. We also design a moving window award mechanism and dynamic pheromone update strategy to improve the search efficiency and solution performance. Computational tests are conducted to evaluate the performance of the proposed method.

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
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  • Agnetic, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229–242.

    Article  Google Scholar 

  • Agnetis, A., Aloulou, M. A., & Fu, L. L. (2014). Coordination of production and interstage batch delivery with outsourced distributuion. European Journal of Operational Research, 238(1), 130–142.

    Article  Google Scholar 

  • Agnetis, A., Hall, N. G., & Pacciarelli, D. (2006). Supply chain scheduling: Sequence coordination. Discrete Applied Mathematics, 154(15), 2044–2063.

    Article  Google Scholar 

  • Asadzadeh, L. (2015). A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Computers & Industrial Engineering, 85, 376–383.

    Article  Google Scholar 

  • Averbakh, I. (2010). On-line integrated production–distribution scheduling problems with capacitated deliveries. European Journal of Operational Research, 200(2), 377–384.

    Article  Google Scholar 

  • Aydinliyim, T., & Vairaktarakis, G. L. (2010). Coordination of outsourced operations to minimize weighted flow time and capacity booking costs. Manufacturing & Service Operations Management, 12(2), 236–255.

    Article  Google Scholar 

  • Babiceanu, R. F., Chen, F. F., & Sturges, R. H. (2005). Real-time holonic scheduling of material handling operations in a dynamic manufacturing environment. Robotics and Computer-Integrated Manufacturing, 21(4–5), 328–337.

    Article  Google Scholar 

  • Baker, K. R., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7–16.

    Article  Google Scholar 

  • Blazewicz, J., Echker, K. H., Pesch, E., Schmidt, G., & Weglarz, J. (2001). Scheduling computer and manufacturing processes (2nd ed.). New Jersey: Springer.

    Book  Google Scholar 

  • Blum, C. (2005). Beam-ACO: Hybridizing ant colony optimization with beam search: An application to open shop scheduling. Computers & Operations Research, 32(6), 1565–1591.

    Article  Google Scholar 

  • Blum, C., & Sampels, M. (2004). An ant colony optimization algorithm for shop scheduling problems. Journal of Mathematical Modelling and Algorithms, 3(3), 285–308.

    Article  Google Scholar 

  • Bose, S., & Pekny, J. F. (2000). A model predictive framework for planning and scheduling problems: A case study of consumer goods supply chain. Computers & Chemical Engineering, 24, 329–335.

    Article  Google Scholar 

  • Chaudhry, I. A., & Khan, A. A. (2016). A research survey: Review of flexible job shop scheduling techniques. International Transactions in Operational Research, 23(3), 551–591.

    Article  Google Scholar 

  • Chen, Z.-L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58(1), 130–148.

    Article  Google Scholar 

  • Chen, Z. L., & Pundoor, G. (2006). Order assignment and scheduling in a supply chain. Operations Research, 54(3), 555–572.

    Article  Google Scholar 

  • Chen, Z. L., & Vairaktarakis, G. L. (2005). Integrated scheduling of production and distribution operations. Management Science, 51(4), 614–628.

    Article  Google Scholar 

  • Denkena, B., Battino, A., & Woelk, P. O. (2005). Intelligent software agents as a basis for collaborative manufacturing systems. First IPROMS Virtual Conference (pp. 17–22). Oxford: Elsevier Ltd.

    Google Scholar 

  • Dorigo, M. (1992). Optimization, Learning and Natural Algorithms. Ph.D. Thesis, Dip. Elettronica.

  • Dorigo, M., & Stützle, T. (2004). Ant colony optimization. Cambridge: MIT Press.

    Book  Google Scholar 

  • Feng, Q., Fan, B. Q., Li, D. S., & Shang, W. P. (2015). Two-agent scheduling with rejection on a single machine. Applied Mathematical Modelling, 39(3–4), 1183–1193.

    Article  Google Scholar 

  • Fu, B., Huo, Y., & Zhao, H. (2012). Coordinated scheduling of production and delivery with production window and delivery capacity constraints. Theoretical Computer Science, 422, 39–51.

    Article  Google Scholar 

  • Gong, H., & Tang, L. (2011). Two-machine flowshop scheduling with intermediate transportation under job physical space consideration. Computer & Operations Research, 38(9), 1267–1274.

    Article  Google Scholar 

  • Gou, L., Luh, P. B., & Kyoya, Y. (1998). Holonic manufacturing scheduling: Architecture, cooperation mechanism, and implementation. Computers in Industry, 37(3), 213–231.

    Article  Google Scholar 

  • Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51, 566–584.

    Article  Google Scholar 

  • Heinonen, J., & Pettersson, F. (2007). Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem. Applied Mathematics and Computation, 187(2), 989–998.

    Article  Google Scholar 

  • Huang, Y. M., & Lin, J. C. (2011). A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems. Expert Systems with Applications, 38(5), 5438–5447.

    Article  Google Scholar 

  • Huang, R. H., & Yang, C. L. (2008). Ant colony system for job shop scheduling with time windows. The International Journal of Advanced Manufacturing Technology, 39(1–2), 151–157.

    Article  Google Scholar 

  • Huang, R. H., Yang, C. L., & Cheng, W. C. (2013). Flexible job shop scheduling with due window—a two-pheromone ant colony approach. International Journal of Production Economics, 141(2), 685–697.

    Article  Google Scholar 

  • Indriago, C., Cardin, O., Bellenguez-Morineau, O., Rakoto, N., & Castagna, P. (2015). Performance evaluation of holonic-based online scheduling for a switch arrival system. IFAC-PapersOnLine, 48(3), 1105–1110.

    Article  Google Scholar 

  • Jana, T. K., Bairagi, B., Paul, S., Sarkar, B., & Saha, J. (2013). Dynamic schedule execution in an agent based holonic manufacturing system. Journal of Manufacturing Systems, 32(4), 801–816.

    Article  Google Scholar 

  • Karimi, N., & Davoudpour, H. (2015). A branch and bound method for solving multi-factory supply chain scheduling with batch delivery. Expert System with Applications, 42(1), 238–245.

    Article  Google Scholar 

  • Kolisch, R. (2000). Integration of assembly and fabrication for make-to-order production. International Journal of Production Economics, 68, 287–306.

    Article  Google Scholar 

  • Kolisch, R., & Hess, K. (2000). Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints. International Journal of Production Research, 38(1), 207–228.

    Article  Google Scholar 

  • Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3–24.

    Article  Google Scholar 

  • Lee, Y., Jeong, C., & Moon, C. (2002). Advanced planning and scheduling with outsourcing in manufacturing supply chain. Computers & Industrial Engineering, 43(1), 351–374.

    Article  Google Scholar 

  • Lei, D. M. (2015). Variable neighborhood search for two-agent flow shop scheduling problem. Computers & Industrial Engineering, 80, 125–131.

    Article  Google Scholar 

  • Leung, J. Y. T., & Chen, Z. L. (2013). Integrated production and distribution with fixed delivery departure dates. Operations Research Letters, 41(3), 290–293.

    Article  Google Scholar 

  • Li, X., Peng, Z., Du, B., Guo, J., Xu, W., & Zhuang, K. (2017). Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems. Computers & Industrial Engineering, 113, 10–26.

    Article  Google Scholar 

  • Li, C. L., & Vairaktarakis, G. (2007). Coordinating production and distribution of jobs with bundling operations. IIE Transaction, 39(2), 203–215.

    Article  Google Scholar 

  • Moon, C., Kim, J., & Hur, S. (2002). Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain. Computers & Industrial Engineering, 43(1), 331–349.

    Article  Google Scholar 

  • Mor, B., & Mosheiov, G. (2010). Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. European Journal of Operational Research, 206(3), 540–546.

    Article  Google Scholar 

  • Nouri, H. E., Driss, O. B., & Ghédira, K. (2015). Hybrid metaheuristics within a holonic multiagent model for the flexible job shop problem. Procedia Computer Science, 60, 83–92.

    Article  Google Scholar 

  • Nouri, H. E., Driss, O. B., & Ghédira, K. (2016). A classification schema for the job shop scheduling problem with transportation resources: State-of-the-art review. In Proceedings of the 5th computer science on-line conference, artificial intelligence perspectives in intelligent systems (Vol 1, pp. 1–11). Springer International Publishing.

  • Nouri, H. E., Driss, O. B., & Ghédira, K. (2016b). Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multiagent model. Computers & Industrial Engineering, 102, 488–501.

    Article  Google Scholar 

  • Panahi, H., & Tavakkoli-Moghaddam, R. (2011). Solving a multi-objective open shop scheduling problem by a novel hybrid ant colony optimization. Expert Systems with Applications, 38(3), 2817–2822.

    Article  Google Scholar 

  • Rossi, A. (2014). Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships. International Journal of Production Economics, 153, 253–267.

    Article  Google Scholar 

  • Sawik, T. (2002). Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line. European Journal of Operational Research, 143, 115–124.

    Article  Google Scholar 

  • Sawik, T. (2014a). Joint supplier selection and scheduling of customer orders under disruption risks: Single versus dual sourcing. Omega, 43, 83–95.

    Article  Google Scholar 

  • Sawik, T. (2014b). Optimization of cost and service level in the presence of supply chain disruption risks: Single vs. multiple sourcing. Computers & Operations Research, 51, 11–20.

    Article  Google Scholar 

  • Selvarajah, E., & Zhang, R. (2014). Supply chain scheduling at the manufacturer to minimize inventory holding and delivery cost. International Journal of Production Economics, 147, 117–124.

    Article  Google Scholar 

  • Shen, L., Dauzère-Pérès, S., & Neufeld, J. S. (2018). Solving the flexible job shop scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 265(2), 503–516.

    Article  Google Scholar 

  • Shen, W., Hao, Q., Yoon, H. J., & Norrie, D. H. (2006). Applications of agent-based systems in intelligent manufacturing: An updated review. Advanced Engineering Informatics, 20(4), 415–431.

    Article  Google Scholar 

  • Shiau, Y. R., Lee, W. C., Kung, Y. S., & Wang, J. Y. (2016). A lower bound for minimizing the total completion time of a three-agent scheduling problem. Information Sciences, 340–341, 305–320.

    Article  Google Scholar 

  • Shyu, S. J., Lin, B. M. T., & Yin, P. Y. (2004). Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Computers & Industrial Engineering, 47(2), 181–193.

    Article  Google Scholar 

  • Song, X. Y., Chang, C. G., & Cao, Y. (2006). Study on the combination of genetic algorithms and ant colony algorithms for solving fuzzy job shop scheduling problems. IMACS Multi conference on Computational Engineering in Systems Applications, 29(7), 1904–1909.

    Google Scholar 

  • Tang, L., Jing, K., & He, J. (2013). An improved ant colony optimisation algorithm for three-tier supply chain scheduling based on networked manufacturing. International Journal of Production Research, 51(13), 3945–3962.

    Article  Google Scholar 

  • Thiruvady, D., Singh, G., Ernst, A. T., & Meyer, B. (2013). Constraint-based ACO for a shared resource constrained scheduling problem. International Journal of Production Economics, 141(1), 230–242.

    Article  Google Scholar 

  • Ullrich, C. A. (2013). Integrated machine scheduling and vehicle routing with time windows. European Journal of Operational Research, 227(1), 152–165.

    Article  Google Scholar 

  • Wang, D. J., Yin, Y. Q., Xu, J. Y., Wu, W. H., Cheng, S. R., & Wu, C. C. (2015). Some due date determination scheduling problems with two agents on a single machine. International Journal of Production Economics, 168, 81–90.

    Article  Google Scholar 

  • Xu, R., Chen, H., & Li, X. (2013). A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system. International Journal of Production Economics, 145(1), 371–386.

    Article  Google Scholar 

  • Yan, J., Ye, K., Wang, H., & Hua, Z. (2010). Ontology of collaborative manufacturing: Alignment of service-oriented framework with service dominant logic. Expert Systems with Applications, 37(3), 2222–2231.

    Article  Google Scholar 

  • Yeung, W. K., Choi, T. M., & Cheng, T. C. E. (2010). Optimal scheduling of a single-supplier single-manufacturer supply chain with common due windows. IEEE Transactions on Automatic Control, 55(12), 2767–2777.

    Article  Google Scholar 

  • Yeung, W. K., Choi, T. M., & Cheng, T. C. E. (2011). Supply chain scheduling and coordination with dual delivery modes and inventory storage cost. International Journal of Production Economics, 132, 223–229.

    Article  Google Scholar 

  • Yimer, A., & Demirli, K. (2010). A genetic approach to two-phase optimization of dynamic supply chain scheduling. Computers & Industrial Engineering, 58(3), 411–422.

    Article  Google Scholar 

  • Yin, Y. Q., Cheng, S. R., Cheng, T. C. E., Wang, D. J., & Wu, C. C. (2015). Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega. https://doi.org/10.1016/j.omega.2015.09.010.

    Article  Google Scholar 

  • You, D. M., & Chen, J. (2003). Application of ant system algorithm in multi-object traveling salesman problem. Mini-Micro Systems, 24(10), 1808–1811.

    Google Scholar 

  • Zegordi, S. H., Abadi, I. N. K., & Nia, M. A. B. (2010). A novel genetic algorithm for solving production and transportation scheduling in a two-stage supply chain. Computers & Industrial Engineering, 58(3), 373–381.

    Article  Google Scholar 

  • Zhang, R., Song, S., & Wu, C. (2013). A hybrid artificial bee colony algorithm for the job shop scheduling problem. International Journal of Production Economics, 141(1), 167–178.

    Article  Google Scholar 

  • Zhong, W., Chen, Z. L., & Chen, M. (2010). Integrated production and distribution scheduling with committed delivery dates. Operations Research Letters, 38(2), 133–138.

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by Grant 71301108, 71201106, 71472034, 71572023 from the National Natural Science Foundation of China, and Grant 18YJC630061 from the Humanity and Social Science Youth Foundation of Ministry of Education of China.

Author information

Authors and Affiliations

  1. College of Transportation Engineering, Dalian Maritime University, Dalian, Liaoning, China

    Liang Tang & Zhihong Jin

  2. School of Business Administration, Northeastern University, Shenyang, Liaoning, China

    Xuwei Qin

  3. School of Maritime Economics and Management, Dalian Maritime University, Dalian, Liaoning, China

    Ke Jing

Authors
  1. Liang Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhihong Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xuwei Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ke Jing
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liang Tang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tang, L., Jin, Z., Qin, X. et al. Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design. Ann Oper Res 275, 685–714 (2019). https://doi.org/10.1007/s10479-018-2976-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-018-2976-y

Keywords

Search

Navigation