Abstract
A problem of scheduling jobs nonpreemptively on a single machine subject to time delay constraints and precedence constraints is considered. Time delay constraints and precedence constraints are fuzzified. Schedules are evaluated not only by their makespan but also by degrees of satisfaction with time delays and degrees of satisfaction with fuzzy precedence.
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.
