Abstract
Abstract The scheduling problem with fuzzy processing times is concerned in this paper. A computational procedure is proposed to obtain the approximated membership function of fuzzy completion time for each schedule. The possibility and necessity measures will be used to propose the ranking concept of fuzzy numbers. Under this ordering among fuzzy numbers, we plan to minimize the fuzzy makespan and total weighted fuzzy completion time. Two types of formulations will be proposed by considering the different directions of ordering among fuzzy numbers. We shall apply the modified virus-evolutionary genetic algorithms to search for the best schedules. Three numerical examples are also provided to clarify the discussions in this paper using the commercial software MATLAB.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
