期刊名称：International Journal of Industrial Engineering Computations
印刷版ISSN：1923-2926
电子版ISSN：1923-2934
出版年度：2011
卷号：2
期号：2
页码：295-306
DOI：10.5267/j.ijiec.2010.03.005
语种：English
出版社：Growing Science Publishing Company
摘要：Job shop scheduling (JSS) problem has been one of the most interesting research issuesin the literature during the recent years. JSS problem has been studied in different formsof deterministic, fuzzy, and stochastic at different depths. The idea of robustoptimization (ROP), on the other hand, has earned a particular value to become apopular subject of the breakthrough for problem solving affairs amongst the researchers.Based on the emerged opportunity for illustrating a new area of search, a robust JSSproblem is proposed as a challenge to this boundary of knowledge. The proposedmethod is capable of handling the perturbation which exists amongst the processingtimes. In fact, in many real world job scheduling problems, a small change in theprocessing times, not only causes a non-optimal solution, but also the infeasibility of thefinal solution may also occur. The proposed robust method could guarantee that, a smalldeviation of the processing times does not affect the feasibility. The implementation ofthe proposed method is illustrated using some numerical examples and the outcomes ofthe investigation are discussed
