Abstract
A model for a preemptive open shop scheduling problem is presented and constraints due to fuzzy resource and allowable time are introduced. This problem is a fuzzy version of the model by Werra et al. and has bi-criteria to be maximized, i.e., minimal satisfaction degree with respect to the processing intervals of jobs and, minimal satisfaction degree of resource amounts used in the processing intervals. We present an efficient algorithm for this problem.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call