Simultaneous Scheduling Through Heuristic Algorithms

  • Authors

    • M Nageswara Rao
    • K Lokesh
    • V Harish
    • Ch Sai Bharath
    • Y Venkatesh
    • Vara Kumari. S
    2018-05-31
    https://doi.org/10.14419/ijet.v7i2.32.15385
  • Flexible Manufacturing System, Heuristic Algo-rithms, makespan, AGVs

  • Flexible Manufacturing System (FMS) is a compli-cated system because of work environments, recu-peration frameworks, mechanized putting away, and material dealing with gadgets like robots and AGVs. In this paper, an endeavor is made by con-sidering both the machine and vehicle planning angles in FMS for minimization of the make trav-erse. Game plan is ensnared with the arrangement of incomplete assets to assignments in finished time. It is like Information-gathering process. It is related with the cost, operations, time and several objectives of the industry. In this work, RAPID ACCESS (RA) heuristic algorithm is adopted to solve the scheduling problems in FMS. Eighty, two problems and their existing solutions with different approaches are examined. The RA heuristic algo-rithm provides better solutions with less computa-tional time.

     

     

  • References

    1. [1] Bilge, U., & Ulusoy, G. (1995). A time window approach to simultaneous scheduling of machines and material handling system in a FMS. Operations Research, 43 (6), 1058–1070.

      [2] Biskup, D., & Herrmann, J. (2008). Single-machine scheduling against due dates with past-sequence-dependent setup times. European Journal of Operational Research, 191 (2), 587–592.

      [3] Campbell, H.G, Dudek, R.A., & Smith M.L. (1970). A Heuristic Algorithm for the n Job m Machine Sequencing Problem. Management Science, 16, B630–B637.

      [4] Cheng, T. C. E., & Lin, B. M. T. (2009). Johnson’s rule, composite jobs and the relocation problem. European Journal of Operational Research, 192, 1008–10013.

      [5] Dannenbring, D. G. (1977). An evaluation of flow shop sequencing heuristics. Management Science, 23(11), 1174-1182.

      [6] Eren, T., & Güner, E. (2008). A bicriterion flowshop scheduling with a learning effect. Applied Mathematical Modeling, 32, 1719–1733.

      [7] Gupta, J. N. D. (1971). A functional heuristic algorithm for the f1owshop scheduling problem. Operational Research, 22, 39-47.

      [8] He, Y., & Hui, C. W. (2008). A rule-based genetic algorithm for the scheduling of single-stage multi-product batch plants with parallel units. Computers and Chemical Engineering, 32, 3067–3083.

      [9] Johnson, S.M. (1954). Optimal two-and-three-stage production schedules with set-up times included. Naval Research Logistic, 1, 61–68.

      [10] Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2005). An evaluation of sequencing heuristics for flexible flowshop scheduling problems with unrelated parallel machines and dual criteria. Otto-von-Guericke-Universitat Magdeburg, 28(05), 1–23.

      [11] Li, X., Wang, Q., & Wu, C. (2009). Efficient composite heuristics for total flowtime minimization in permutation flow shops. OMEGA, the International Journal of Management Science, 37 (1), 155–164.

  • Downloads

  • How to Cite

    Nageswara Rao, M., Lokesh, K., Harish, V., Sai Bharath, C., Venkatesh, Y., & Kumari. S, V. (2018). Simultaneous Scheduling Through Heuristic Algorithms. International Journal of Engineering & Technology, 7(2.32), 125-130. https://doi.org/10.14419/ijet.v7i2.32.15385