Abstract
The job-shop scheduling problems with fuzzy processing time and fuzzy due date are investigated in this paper. The ranking concept among fuzzy numbers based on possibility and necessity measures which are developed in fuzzy sets theory is introduced. And on the basis of two consistent measures in this concept, several novel objective functions are proposed. The purpose of our research is to obtain the optimal schedules based on these objective functions. A modified DE algorithm will be designed to solve these objective functions. Several jop-shop scheduling problems with fuzzy processing time and fuzzy due date are experimented to show the efficiency and comparability of our approach. Through the experimental results, the potential application of the possibility and necessity theory in the real world is shown.
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 callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: 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.
