Abstract
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of a cost function thatincludes the costs of earliness, tardiness, makespan and resource consumption jointly by scheduling the jobs under precedence constraints and determining the due date and the resource allocation amount satisfying resource constraints for each job. First, the problem is shown to be NP-hard. Furthermore, an optimal algorithm with polynomial time for the special case of this problem is put forward. Moreover, an efficient 2-approximation algorithm is presented based on solving the relaxation of the problem. Finally, the numerical experiment is given, whose results show that our method is promising.
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.
