مرکز اطلاعات علمی 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:

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

Download:

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

Cites:

Information Journal Paper

Title

A HEURISTIC APPROACH FOR MULTI-STAGE SEQUENCE-DEPENDENT GROUP SCHEDULING PROBLEMS

Pages

  48-58

Abstract

 We present several heuristic algorithms based on TABU SEARCH for solving the multi-stage sequencedependent group SCHEDULING (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initial solution generators are developed to aid in the application of the TABU SEARCH-based algorithms. A LOWER BOUNDing technique based on relaxing the mathematical model for the original SDGS problem is applied to estimate the quality of the heuristic algorithms. To find the best heuristic algorithm, random test problems, ranging in size from small, medium, to large are created and solved by the heuristic algorithms. A detailed statistical experiment, based on nested split-plot design, is performed to find the best heuristic algorithm and the best initial solution generator. The results of the experiment show that the TABU SEARCH-based algorithms can provide high quality solutions for the problems with an average percentage error of only 1.00%.

Cites

  • No record.
  • References

    Cite

    APA: Copy

    SALMASI, N., & LOGENDRAN, R.. (2008). A HEURISTIC APPROACH FOR MULTI-STAGE SEQUENCE-DEPENDENT GROUP SCHEDULING PROBLEMS. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 4(7), 48-58. SID. https://sid.ir/paper/309777/en

    Vancouver: Copy

    SALMASI N., LOGENDRAN R.. A HEURISTIC APPROACH FOR MULTI-STAGE SEQUENCE-DEPENDENT GROUP SCHEDULING PROBLEMS. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2008;4(7):48-58. Available from: https://sid.ir/paper/309777/en

    IEEE: Copy

    N. SALMASI, and R. LOGENDRAN, “A HEURISTIC APPROACH FOR MULTI-STAGE SEQUENCE-DEPENDENT GROUP SCHEDULING PROBLEMS,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 4, no. 7, pp. 48–58, 2008, [Online]. Available: https://sid.ir/paper/309777/en

    Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button