Skip to main content

Advertisement

SpringerLink
Log in

Inference search algorithm for optimizing scheduling and minimizing mean tardiness in parallel joint robots

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

The issue of scheduling identical parallel joint robots to reduce the mean tardiness is one of the most important challenges in industrial parallel robots. Precedence and job inconsistency are the constraint of this challenging issue. Indeed, due to the precedence constraint and inconsistencies among jobs, achieving best solution to schedule a number of jobs in a number of robots is highly difficult. This problem is regarded as one of the NP-hard class issues. In this study, despite the constraints of precedence and inconsistency among jobs, a new method based on inference search (IS) algorithm was proposed for scheduling and minimizing mean tardiness in identical parallel joint robots. Results of the simulations conducted in this study indicate that the proposed method, unlike genetic algorithms (GA), tabu search (TS) algorithms and hybrid intelligent solution system (HISS) is scalable and it optimized the parameters of mean tardiness and system solution time.

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

Similar content being viewed by others

References

  • Abdel-Basset M, Atef A, Hussein A-N (2018) Some appraisal criteria for multi-mode scheduling problem. J Ambient Intell Hum Comput. https://doi.org/10.1007/s12652-018-0771-x

    Article  Google Scholar 

  • Baesler F, Palma C (2014) Multiobjective parallel machine scheduling in the sawmill industry using memetic algorithms. Int J Adv Manuf Technol 74:757–768

    Article  Google Scholar 

  • Baizid K, Yousnadj A, Meddahi A, Chellali R, Iqbal J (2015) Time scheduling and optimization of industrial robotized tasks based on genetic algorithms. Robot CIM Manuf 34:140–150

    Article  Google Scholar 

  • Balin S (2011) Non-identical parallel machine scheduling using genetic algorithm. Expert Syst Appl 38:6814–6821

    Article  Google Scholar 

  • Bilyk A, Mönch L, Almeder C (2014) Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics. Comput Ind Eng 78:175–185

    Article  Google Scholar 

  • Çakar T, Köker R, Demir H (2008) Parallel robot scheduling to minimize mean tardiness with precedence constraints using a genetic algorithm. Adv Eng Soft 39:47–54

    Article  Google Scholar 

  • Çakar T, Köker R, Sarı Y (2012) Parallel robot scheduling to minimize mean tardiness with unequal release date and precedence constraints using a hybrid intelligent system. Int J Adv Robot Syst 9:252

    Article  Google Scholar 

  • Chen CL, Lee CG, Hou ES (1988) Efficient scheduling algorithms for robot inverse dynamics computation on a multiprocessor system. IEEE Trans Syst Man Cybern 18:729–743

    Article  Google Scholar 

  • Costa A (2015) Hybrid genetic optimization for solving the batch-scheduling problem in a pharmaceutical industry. Comput Ind Eng 79:130–147

    Article  Google Scholar 

  • Dang Q-V, Nguyen L (2017) Makespan minimisation for pre-emptive scheduling of mobile robots in FMS environment. Int J Metaheuristics 6:3–36

    Article  Google Scholar 

  • Erdoğan G, Battarra M, Laporte G (2014) Scheduling twin robots on a line. Naval Res Logist (NRL) 61:119–130

    Article  MathSciNet  Google Scholar 

  • Fan B, Yang W, Zhang Z (2018) Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm. J Ambient Intell Hum Comput. https://doi.org/10.1007/s12652-018-0903-3

    Article  Google Scholar 

  • Guinet A (1993) Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. Int J Prod Res 31:1579–1594

    Article  Google Scholar 

  • Joo CM, Kim BS (2015) Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability. Comput Ind Eng 85:102–109

    Article  Google Scholar 

  • Kasahara H, Narita S (1985) Parallel processing of robot-arm control computation on a multimicroprocessor system. IEEE J Robot Autom 1:104–113

    Article  Google Scholar 

  • Kayvanfar V, Zandieh M, Teymourian E (2017) An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach. Comput Appl Math 36:159–184

    Article  MathSciNet  Google Scholar 

  • Lara AFB, Yalaoui F, Dugardin F (2012) A tabu search algorithm to minimize the total tardiness in the parallel machines scheduling problem. IFAC Proc 45:1371–1376

    Article  Google Scholar 

  • LaValle SM (2006) Planning algorithms. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Liang X, Huang M, Ning T (2018) Flexible job shop scheduling based on improved hybrid immune algorithm. J Ambient Intell Hum Comput 9:165–171

    Article  Google Scholar 

  • Liao TW, Chang P, Kuo R, Liao C-J (2014) A comparison of five hybrid metaheuristic algorithms for unrelated parallel-machine scheduling and inbound trucks sequencing in multi-door cross docking systems. Appl Soft Comput 21:180–193

    Article  Google Scholar 

  • Ning T, Huang M, Liang X, Jin H (2016) A novel dynamic scheduling strategy for solving flexible job-shop problems. J Ambient Intell Hum Comput 7:721–729

    Article  Google Scholar 

  • Novas JM, Henning GP (2014) Integrated scheduling of resource-constrained flexible manufacturing systems using constraint programming. Expert Syst Appl 41:2286–2299

    Article  Google Scholar 

  • Safarzadeh S, Shadrokh S, Salehian A (2018) A heuristic scheduling method for the pipe-spool fabrication process. J Ambient Intell Hum Comput 9:1901–1918. https://doi.org/10.1007/s12652-018-0737-z

    Article  Google Scholar 

  • Sana SS, Ospina-Mateus H, Arrieta FG, Chedid JA (2018) Application of genetic algorithm to job scheduling under ergonomic constraints in manufacturing industry. J Ambient Intell Hum Comput. https://doi.org/10.1007/s12652-018-0814-3

    Article  Google Scholar 

  • Shen J, Zhu Y (2018) A parallel-machine scheduling problem with periodic maintenance under uncertainty. J Ambient Intell Hum Comput. https://doi.org/10.1007/s12652-018-1032-8

    Article  Google Scholar 

  • Sombolestan S, Rasooli A, Khodaygan S (2018) Optimal path-planning for mobile robots to find a hidden target in an unknown environment based on machine learning. J Ambient Intell Hum Comput. https://doi.org/10.1007/s12652-018-0777-4

    Article  Google Scholar 

  • Ta QC, Billaut J-C, Bouquard J-L (2015) Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem. J Intell Manuf. https://doi.org/10.1007/s10845-015-1046-4

    Article  Google Scholar 

  • Thomasson O, Battarra M, Erdoğan G, Laporte G (2018) Scheduling twin robots in a palletising problem. Int J Prod Res 56:518–542

    Article  Google Scholar 

  • Wang M, Ma S, Li B, Wang Y, He X, Zhang L (2005) Task planning and behavior scheduling for a reconfigurable planetary robot system. In: IEEE international conference mechatronics and automation, 2005. IEEE, pp 729–734

  • Zhang Y, Parker LE (2013) Multi-robot task scheduling. In: Robotics and automation (ICRA) 2013 IEEE international conference. IEEE, pp 2992–2998

  • Zhang C-L, Wang J-Q, Zhang C-W (2018) Two-agent scheduling on a single parallel-batching machine to minimize the weighted sum of the agents’ makespans. J Ambient Intell Hum Comput. https://doi.org/10.1007/s12652-018-0741-3

    Article  Google Scholar 

Download references

Acknowledgements

We are grateful to the editor and the anonymous reviewers for their helpful suggestions on an earlier version of this paper.

Author information

Authors and Affiliations

  1. Department of Mechatronic Engineering, Bafgh Branch, Islamic Azad University, Bafgh, Iran

    Saman Tamizi

  2. Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran

    Ali Ghaffari

Authors
  1. Saman Tamizi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ali Ghaffari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ali Ghaffari.

Additional information

Publisher’s Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tamizi, S., Ghaffari, A. Inference search algorithm for optimizing scheduling and minimizing mean tardiness in parallel joint robots. J Ambient Intell Human Comput 10, 4771–4783 (2019). https://doi.org/10.1007/s12652-018-1155-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-018-1155-y

Keywords

Search

Navigation