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

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

Download:

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

Cites:

Information Journal Paper

Title

A NEW APPROACH IN JOB SHOP SCHEDULING: OVERLAPPING OPERATION

Pages

  25-32

Abstract

 In this paper, a new approach to OVERLAPPING operations in JOB SHOP SCHEDULING is presented. In many JOB SHOPs, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. In each job, embedded operations can be performed due to OVERLAPPING considerations in which each operation may be overlapped with the others because of its nature. The effects of the new approach on JOB SHOP SCHEDULING problems are evaluated. Since the problem is well known as NP-Hard class, a SIMULATED ANNEALING algorithm is developed to solve large scale problems. Moreover, a mixed integer linear programming (MILP) method is applied to validate the proposed algorithm. The approach is tested on a set of random data to evaluate and study the behavior of the proposed algorithm. Computational experiments confirmed superiority of the proposed approach. To evaluate the effect of OVERLAPPING considerations on the JOB SHOP SCHEDULING problem, the results of classical JOB SHOP SCHEDULING with the new approach (job shop SCHEDULING problem with OVERLAPPING operations) are compared. It is concluded that the proposed approach can improve the criteria and machines utilization measures in JOB SHOP SCHEDULING. The proposed approach can be applied easily in real factory conditions and for large size problems. It should thus be useful to both practitioners and researchers.

Cites

  • No record.

    • References

    Cite

    APA: Copy

    FATTAHI, PARVIZ, & SAIDI MEHRABAD, MOHAMMAD. (2009). A NEW APPROACH IN JOB SHOP SCHEDULING: OVERLAPPING OPERATION. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 3(PRE. NO. 3), 25-32. SID. https://sid.ir/paper/572367/en

    Vancouver: Copy

    FATTAHI PARVIZ, SAIDI MEHRABAD MOHAMMAD. A NEW APPROACH IN JOB SHOP SCHEDULING: OVERLAPPING OPERATION. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2009;3(PRE. NO. 3):25-32. Available from: https://sid.ir/paper/572367/en

    IEEE: Copy

    PARVIZ FATTAHI, and MOHAMMAD SAIDI MEHRABAD, “A NEW APPROACH IN JOB SHOP SCHEDULING: OVERLAPPING OPERATION,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 3, no. PRE. NO. 3, pp. 25–32, 2009, [Online]. Available: https://sid.ir/paper/572367/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