Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

232
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

140
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

1

Information Journal Paper

Title

AN ALGORITHM FOR MULTI-OBJECTIVE JOB SHOP SCHEDULING PROBLEM

Pages

  43-53

Abstract

 Scheduling for JOB SHOP is very important in both fields of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we propose a PARETO APPROACH to solve MULTI-OBJECTIVE JOB SHOP SCHEDULING. The objective considered is to minimize the overall completion time (makespan) and total weighted tardiness (TWT). An effective SIMULATED ANNEALING algorithm based on proposed approach is presented to solve MULTI-OBJECTIVE JOB SHOP SCHEDULING problems. An external memory of non-dominated solutions is considered to save and update the non-dominated solutions during the problem solving process. The parameters in the proposed algorithm are determined after conducting a pilot study. Numerical examples are used to evaluate and study the performance of the proposed algorithm.

Cites

References

  • No record.
  • Cite

    APA: Copy

    FATAHI, P., SAEIDI MEHRABAD, MOHAMMAD, & ARIANEZHAD, M.B.. (2006). AN ALGORITHM FOR MULTI-OBJECTIVE JOB SHOP SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 2(3), 43-53. SID. https://sid.ir/paper/309820/en

    Vancouver: Copy

    FATAHI P., SAEIDI MEHRABAD MOHAMMAD, ARIANEZHAD M.B.. AN ALGORITHM FOR MULTI-OBJECTIVE JOB SHOP SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2006;2(3):43-53. Available from: https://sid.ir/paper/309820/en

    IEEE: Copy

    P. FATAHI, MOHAMMAD SAEIDI MEHRABAD, and M.B. ARIANEZHAD, “AN ALGORITHM FOR MULTI-OBJECTIVE JOB SHOP SCHEDULING PROBLEM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 2, no. 3, pp. 43–53, 2006, [Online]. Available: https://sid.ir/paper/309820/en

    Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top