Abstract
This paper considers single-stage multi-parallel machines scheduling problems. A fuzzy scheduling model is developed with objective to minimize the makespan. In the scheduling model, the uncertainty of processing time is represented by triangular fuzzy number, and the credibility theory is used to assess fuzzy number. In the optimal scheduling searching process, we introduce matching theory to model the scheduling problem consider in this paper, and two heuristic rules are used to improve searching efficiency. At last, genetic algorithm is developed for solving the scheduling problem, and numerical example shows good result.
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.
