Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Chaukwale, R."

Filter results by typing the first few letters
Now showing 1 - 4 of 4
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    A modified Ant Colony optimization algorithm with load balancing for job shop scheduling
    (IEEE Computer Society help@computer.org, 2013) Chaukwale, R.; Kamath S․, S.S.
    The problem of efficiently scheduling jobs on several machines is an important consideration when using Job Shop scheduling production system (JSP). JSP is known to be a NP-hard problem and hence methods that focus on producing an exact solution can prove insufficient in finding an optimal resolution to JSP. Hence, in such cases, heuristic methods can be employed to find a good solution within reasonable time. In this paper, we study the conventional ACO algorithm and propose a Load Balancing ACO algorithm for JSP. We also present the observed results, and discuss them with reference to the conventional ACO. It is observed that the proposed algorithm gives better results when compared to conventional ACO. © 2013 IEEE.
  • No Thumbnail Available
    Item
    An equal share ant colony optimization algorithm for job shop scheduling adapted to cloud environments
    (Springer Verlag service@springer.de, 2014) Chaukwale, R.; Kamath S․, S.
    The problem of efficiently scheduling jobs on several machines is an important consideration for Cloud computing. Task scheduling in Cloud Environment is a recognised NP-hard problem and hence methods that focus on producing an exact solution can prove insufficient in finding an optimal resolution to JSSP. Hence, in such cases, heuristic methods can be employed to find a good solution within reasonable time. In this paper, we study the conventional ACO algorithm and propose two Load Balancing ACO algorithms for task scheduling in Cloud Environment. We also present the observed results, and discuss them with reference to the FCFS scheduling algorithm currently used. It is observed that the proposed algorithm gives better results for every problem size. Also the proposed algorithms are adapted and applied to Task scheduling in Cloud Environment and is found to give better results. © 2014 Springer International Publishing Switzerland.
  • No Thumbnail Available
    Item
    An equal share ant colony optimization algorithm for job shop scheduling adapted to cloud environments
    (2014) Chaukwale, R.; Sowmya, Kamath S.
    The problem of efficiently scheduling jobs on several machines is an important consideration for Cloud computing. Task scheduling in Cloud Environment is a recognised NP-hard problem and hence methods that focus on producing an exact solution can prove insufficient in finding an optimal resolution to JSSP. Hence, in such cases, heuristic methods can be employed to find a good solution within reasonable time. In this paper, we study the conventional ACO algorithm and propose two Load Balancing ACO algorithms for task scheduling in Cloud Environment. We also present the observed results, and discuss them with reference to the FCFS scheduling algorithm currently used. It is observed that the proposed algorithm gives better results for every problem size. Also the proposed algorithms are adapted and applied to Task scheduling in Cloud Environment and is found to give better results. � 2014 Springer International Publishing Switzerland.
  • No Thumbnail Available
    Item
    A modified Ant Colony optimization algorithm with load balancing for job shop scheduling
    (2013) Chaukwale, R.; Sowmya, Kamath S.
    The problem of efficiently scheduling jobs on several machines is an important consideration when using Job Shop scheduling production system (JSP). JSP is known to be a NP-hard problem and hence methods that focus on producing an exact solution can prove insufficient in finding an optimal resolution to JSP. Hence, in such cases, heuristic methods can be employed to find a good solution within reasonable time. In this paper, we study the conventional ACO algorithm and propose a Load Balancing ACO algorithm for JSP. We also present the observed results, and discuss them with reference to the conventional ACO. It is observed that the proposed algorithm gives better results when compared to conventional ACO. � 2013 IEEE.

Maintained by Central Library NITK | DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify