Abstract

The paper deals with a single machine scheduling problem involving a general precedence structure that permits both ordinary and fuzzy precedence constraints. Feasible schedules are evaluated not only by their cost but also by the degree of satisfaction with their precedence structure. An O(mlogn+ max(n 2, Kn 2))-time algorithm is proposed for finding nondominated solutions of the resulting bi-criteria scheduling problem where n is the number of jobs, k is the number of fuzzy constrains, and m is the total number of precedence constraints.

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

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.