Research Output | Dar Al-hikmah Library | IIUM Only
The job scheduling problem (JSP) is considered as one of the most complex combinatorial optimization problems. JSP is not an independent task, but is rather a part of a company business case. In this paper, we have studied JSPs under sudden machine breakdown scenarios that introduce a risk of not completing the jobs on time. We have first solved JS