مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

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:

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

Download:

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

Cites:

Information Journal Paper

Title

MULTI-OBJECTIVE FLEXIBLE DYNAMIC JOB-SHOP SCHEDULING PROBLEM CONSIDERING MAINTENANCE CONSTRAINT

Pages

  13-26

Abstract

 In this paper, Multi-objective Flexible dynamic Job shop scheduling with MAINTENANCE constraints is investigated. In the recent researches the single objective models were assessed. Whereas in competitive conditions, decision makers encountered with simultaneous multi-objective problems that could be conflict with each other. In this research, the objectives are makespan, mean flow time and mean tardiness. These objectives are adaptable to the concept of just-in-time and supply chain management. In real world, machines may be unavailable for various reasons, such as MAINTENANCE. In this paper deterministic machine availability as a non-fixed availability is studied. Therefore a mathematical model and improved GENETIC ALGORITHM with dynamic control parameters that changed through the algorithm is proposed to reducing the probability of early convergence and local optimum. Moreover a heuristic algorithm is proposed to solve MAINTENANCE sub-problem. Computational experiments for the three flexibility levels show that the best result of proposed algorithm without MAINTENANCE have 3.9%, 4.9% and 4.55% improvement and mean results have 4.9%, 5.33% and 4.6% improvement compared with existing methods. And with considering one, two and three MAINTENANCE, the mean of objective function have increased 4.68%, 9.48% and 11.75%. The results show the superiority of the proposed algorithm.

Cites

  • No record.
  • References

  • No record.
  • Cite

    APA: Copy

    NAHAVANDI, NASIM, & ABBASIAN, MOHAMMAD. (2011). MULTI-OBJECTIVE FLEXIBLE DYNAMIC JOB-SHOP SCHEDULING PROBLEM CONSIDERING MAINTENANCE CONSTRAINT. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 22(1), 13-26. SID. https://sid.ir/paper/65360/en

    Vancouver: Copy

    NAHAVANDI NASIM, ABBASIAN MOHAMMAD. MULTI-OBJECTIVE FLEXIBLE DYNAMIC JOB-SHOP SCHEDULING PROBLEM CONSIDERING MAINTENANCE CONSTRAINT. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2011;22(1):13-26. Available from: https://sid.ir/paper/65360/en

    IEEE: Copy

    NASIM NAHAVANDI, and MOHAMMAD ABBASIAN, “MULTI-OBJECTIVE FLEXIBLE DYNAMIC JOB-SHOP SCHEDULING PROBLEM CONSIDERING MAINTENANCE CONSTRAINT,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 22, no. 1, pp. 13–26, 2011, [Online]. Available: https://sid.ir/paper/65360/en

    Related Journal Papers

    Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top