Skip to main content
SpringerLink
Log in

Cooperative and non-cooperative algorithms for distributed parallel jobs scheduling

  • Published:
Flexible Services and Manufacturing Journal Aims and scope Submit manuscript

Abstract

This paper deals with multi-factory parallel job scheduling in which independent factories try to satisfy market demand by cooperating with each other. In parallel job scheduling, unlike classical scheduling, jobs require a pre-specified job-dependent number of machines simultaneously when being processed. In the research, although it is assumed that the factories operate separately, in some cases, due to a large number of orders in one factory, some jobs may be sent to other factories to minimize the total completion time of jobs taking into account transportation time. In other words, in this system, it is assumed that each factory, after satisfying the demand of its region, can cooperate with other factories in order to achieve a better objective function for the production network. In the first step of the proposed approach, after associating the scheduling system with a constrained graph, a semidefinite programming rounding and a heuristic are proposed to color the graph in small and large-size instances, respectively. Finally, in the first step, it is shown that the problem under study can be reduced to a parallel machine scheduling problem. Given the heterogeny of factories, in the next step, mixed-integer linear programming, as well as two heuristic algorithms, are proposed. The comparison results of the proposed algorithm, imperialist competitive algorithm and the non-cooperative local scheduling algorithm show that the two-phase cooperative distributed algorithm is quite efficient.

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

Similar content being viewed by others

Data availability

The datasets used and/or analyzed during the current study are available from the corresponding author on reasonable request.

Notes

  1. YALMIP site: http://users.isy.liu.se/johanl/yalmip/pmwiki.php?n=Main.Download

References

  • Abdollahzadeh V, Nakhaikamalabadi I, Hajimolana SM, Zegordi SH (2018) A multifactory integrated production and distribution scheduling problem with parallel machines and immediate shipments solved by improved whale optimization algorithm. Complexity 2018:5120640

    Google Scholar 

  • Alaghebandha M, Naderi B, Mohammadi M (2019) Economic lot sizing and scheduling in distributed permutation flowshops. J Optim Ind Eng 12:103–117

    Google Scholar 

  • Barbosa JG, Moreira B (2011) Dynamic scheduling of a batch of parallel task jobs on heterogeneous clusters. Parallel Comput 37:428–438

    Google Scholar 

  • Behdani B, Lukszo Z, Adhitya A, Srinivasan R (2010) Decentralized vs centralized management of abnormal situations in a multi-plant enterprise using an agent-based approach. Comput Aided Chem Eng 28:1219–1224

    Google Scholar 

  • Behnamian J (2014) Decomposition based hybrid VNS–TS algorithm for distributed parallel factories scheduling with virtual corporation. Comput Oper Res 52:181–191

    MathSciNet  Google Scholar 

  • Behnamian J (2016) Graph colouring-based algorithm to parallel jobs scheduling on parallel factories. Int J Comput Integr Manuf 29:622–635

    Google Scholar 

  • Behnamian J (2017) Heterogeneous networked cooperative scheduling with anarchic particle swarm optimization. IEEE Trans Eng Manag 64:166–178

    Google Scholar 

  • Behnamian J (2020) Parallel jobs scheduling with a specific due date: a semi-definite relaxation-based algorithm. J Optim Ind Eng 13(2):199–210

    Google Scholar 

  • Behnamian J, Fatemi Ghomi SMT (2013) The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machines. Inf Sci 219:181–196

    MathSciNet  Google Scholar 

  • Behnamian J, Fatemi Ghomi SMT (2015) Minimizing cost-related objective in synchronous scheduling of parallel factories in virtual production network. Appl Soft Comput 29:221–232

    Google Scholar 

  • Behnamian J, Fatemi Ghomi SMT (2016) A survey of multi-factory scheduling. J Intell Manuf 27:231–249

    Google Scholar 

  • Behnamian J, Fatemi Ghomi SMT (2021) Multi-objective multi-factory scheduling. RAIRO-Oper Res. https://doi.org/10.1051/ro/2020044

    Article  MathSciNet  Google Scholar 

  • Błądek I, Drozdowski M, Guinand F et al (2015) On contiguous and non-contiguous parallel task scheduling. J Sched 18:487–495

    MathSciNet  Google Scholar 

  • Brelsford D, Chochia G, Falk N, Marthi K, Sure R, Bobroff N, Fong L, Seelam S (2013) Partitioned parallel job scheduling for extreme scale computing. In: Cirne W, Desai N, Frachtenberg E, Schwiegelshohn U (eds) Job scheduling strategies for parallel processing JSSPP 2012, Lecture notes in computer science. Springer, Berlin, Heidelberg, vol 7698, pp 157–177. https://doi.org/10.1007/978-3-642-35867-8_9

  • Chan FT, Chung SH, Chan P (2005) An adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert Syst Appl 29:364–371

    Google Scholar 

  • Chen S-q, Huang J-g, Chen J-e (2002) Approximation algorithm for multiprocessor parallel job scheduling. J Cent South Univ Technol 9:267–272

    Google Scholar 

  • Dessouky MM (1998) Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness. Comput Ind Eng 34:793–806

    Google Scholar 

  • Dietze R, Rünger G (2020) Search-based scheduling for parallel tasks on heterogeneous platforms. Lecture notes in computer science, vol 11997. Springer, Cham

    Google Scholar 

  • Ebrahimi Moghaddam M, Bonyadi MR (2012) An immune-based genetic algorithm with reduced search space coding for multiprocessor task scheduling problem. Int J Parallel Prog 40:225–257

    Google Scholar 

  • Gharaei A, Jolai F (2018) A multi-agent approach to the integrated production scheduling and distribution problem in multi-factory supply chain. Appl Soft Comput 65:577–589

    Google Scholar 

  • Guo S, Kang L (2010) Online scheduling of malleable parallel jobs with setup times on two identical machines. Eur J Oper Res 206:555–561

    MathSciNet  Google Scholar 

  • Guo S, Kang L (2013) Online scheduling of parallel jobs with preemption on two identical machines. Oper Res Lett 41:207–209

    MathSciNet  Google Scholar 

  • Hao Y, Wang L, Zheng M (2016) An adaptive algorithm for scheduling parallel job in meteorological Cloud. Knowl Based Syst 98:226–240

    Google Scholar 

  • Hao Y, Xia M, Wen N, Hou R, Deng H, Wang L, Wang Q (2017) Parallel task scheduling under multi-Clouds. KSII Trans Internet Inf Syst 11:39–60

    Google Scholar 

  • Henning S, Jansen K, Rau M et al (2020) Complexity and inapproximability results for parallel task scheduling and strip packing. Theory Comput Syst 64:120–140

    MathSciNet  Google Scholar 

  • Jansen K, Porkolab L (2002) Linear-time approximation schemes for scheduling malleable parallel tasks. Algorithmica 32:507–520

    MathSciNet  Google Scholar 

  • Jansen K, Trystram D (2016) Scheduling parallel job on heterogeneous platforms. Electron Notes Discrete Math 55:9–12

    Google Scholar 

  • Jansen K (2002) Scheduling malleable parallel tasks: An asymptotic fully polynomial-time approximation scheme. In: Möhring R, Raman R (eds) Proceedings of ESA 2002. LNCS, 2461. Springer, Berlin, pp 562–574

  • Jiang X, Guan N, Long X, Tang Y, He Q (2020) Real-time scheduling of parallel tasks with tight deadlines. J Syst Archit 108:101742

    Google Scholar 

  • Karger D, Motwani R, Sudan M (1998) Approximate graph coloring by semidefinite programming. J ACM 45:246–265

    MathSciNet  Google Scholar 

  • Lei D, Liu M (2020) An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance. Comput Ind Eng 141:106320

    Google Scholar 

  • Lei D, Yuan Y, Cai J (2020a) An improved artificial bee colony for multi-objective distributed unrelated parallel machine scheduling. Int J Prod Res 59:5259–5271

    Google Scholar 

  • Lei D, Yuan Y, Cai J, Bai D (2020b) An imperialist competitive algorithm with memory for distributed unrelated parallel machine scheduling. Int J Prod Res 58:597–614

    Google Scholar 

  • Li K (2018) Scheduling parallel tasks with energy and time constraints on multiple manycore processors in a cloud computing environment. Future Gener Comput Syst 82:591–605

    Google Scholar 

  • Li K, Pan Y (2000) Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation. IEEE Trans Comput 49:1021–1030

    MathSciNet  Google Scholar 

  • Liu X, Zha Y, Yin Q, Peng Y, Qin L (2015) Scheduling parallel job with tentative runs and consolidation in the cloud. J Syst Softw 104:141–151

    Google Scholar 

  • Naderi B, Ruiz R (2014) A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur J Oper Res 239:323–334

    MathSciNet  Google Scholar 

  • Parida S, Nayak SC, Priyadarshi P, Pattnaik PK, Ray G (2018) Petri Net: design and analysis of parallel task scheduling algorithm. In: Kalam A, Das S, Sharma K (eds) Advances in electronics, communication and computing. Lecture notes in electrical engineering, vol 443. Springer, Singapore

    Google Scholar 

  • Shapiro SS, Wilk MB (1965) An analysis of variance test for normality (complete samples). Biometrika 52(3/4):591–611. https://doi.org/10.2307/2333709

    Article  MathSciNet  Google Scholar 

  • Sun H, Hsu W-J, Cao Y (2014) Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency. J Parallel Distrib Comput 74:2180–2192

    Google Scholar 

  • Terrazas-Moreno S, Grossmann IE (2011) A multiscale decomposition method for the optimal planning and scheduling of multi-site continuous multiproduct plants. Chem Eng Sci 66:4307–4318

    Google Scholar 

  • Wachtel G, Elalouf A (2020) Efficient approximation scheme for job assignment in a multi-factory environment. J Ind Prod Eng 37:313–320

    Google Scholar 

  • Williams JF (1981) Heuristic techniques for simultaneous scheduling of production and distribution in multi-echelon structures: theory and empirical comparisons. Manag Sci 27:336–352

    Google Scholar 

  • Ye D, Zhang G (2007) On-line scheduling of parallel jobs in a list. J Sched 10:407–413

    MathSciNet  Google Scholar 

  • Zhang L, Zhou L, Salah A (2020) Efficient scientific workflow scheduling for deadline-constrained parallel tasks in cloud computing environments. Inf Sci 531:31–46

    MathSciNet  Google Scholar 

  • Zheng B, Pan L, Liu S (2021) Market-oriented online bi-objective service scheduling for pleasingly parallel jobs with variable resources in cloud environments. J Syst Softw 176:110934

    Google Scholar 

  • Zong Z, Manzanares A, Ruan X, Qin X (2011) EAD and PEBD: two energy-aware duplication scheduling algorithms for parallel tasks on homogeneous clusters. IEEE Trans Comput 603:360–374

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran

    Javad Behnamian

Authors
  1. Javad Behnamian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Javad Behnamian.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Behnamian, J. Cooperative and non-cooperative algorithms for distributed parallel jobs scheduling. Flex Serv Manuf J 36, 151–174 (2024). https://doi.org/10.1007/s10696-022-09469-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10696-022-09469-4

Keywords

Search

Navigation