• FUZZY CDS ALGORITHM FOR A FLOWSHOP SCHEDULING PROBLEM

VINOBA V., SELVAMALAR N.*

Abstract


In job sequencing for a flowshop, processing times are generally not known exactly. Only values occur in estimated intervals. So Fuzzy numbers come in handy to represent these interval values. In this paper, the fuzzified Campbell, Dudek and Smith (CDS)job sequencing algorithm is employed with octagonal fuzzy processing times. The results are deterministic sequences but the sequence performance criteria like the makespan and mean flow time are fuzzy and are calculated using fuzzy arithmetic.


Keywords


Flow-shop scheduling, CDS Algorithm, Octagonal fuzzy numbers.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility		Web Counter
https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://siipbang.katingankab.go.id/storage_old/maxwin/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/https://waper.serdangbedagaikab.go.id/storage/app/https://waper.serdangbedagaikab.go.id/storage/idn/