عرض بسيط للتسجيلة

المؤلفAli, Arshad
المؤلفGajpal, Yuvraj
المؤلفElmekkawy, Tarek Y.
تاريخ الإتاحة2024-09-17T10:49:02Z
تاريخ النشر2021
اسم المنشورOPSEARCH
المصدرScopus
الرقم المعياري الدولي للكتاب303887
معرّف المصادر الموحدhttp://dx.doi.org/10.1007/s12597-020-00484-3
معرّف المصادر الموحدhttp://hdl.handle.net/10576/59028
الملخصThis paper considers the distributed permutation flowshop scheduling problem (DPFSP) which is an extension of permutation flowshop scheduling problem (PFSP). In DPFSP, there are multiple parallel factories instead of one factory as in PFSP. Each factory consists of same number of machines, and jobs can be processed in either of the factories to perform all necessary operations. This paper considers DPFSP for minimizing the total completion time objective. An MILP formulation is developed to find the optimal solution. To solve the problem, a metaheuristic, tabu search (TS) is proposed. Numerical experiments are performed on benchmark problem instances from the literature, and results of the proposed method are compared with current metaheuristics in the literature for this problem. The tabu search outperforms all existing metaheuristics in terms of solution quality.
اللغةen
الناشرSpringer
الموضوعDistributed permutation flowshop
Metaheuristics
Parallel flowshop
Scheduling
Tabu search
Total completion time
العنوانDistributed permutation flowshop scheduling problem with total completion time objective
النوعArticle
الصفحات425-447
رقم العدد2
رقم المجلد58
dc.accessType Full Text


الملفات في هذه التسجيلة

Thumbnail

هذه التسجيلة تظهر في المجموعات التالية

عرض بسيط للتسجيلة